Книга: Yamuna Manimuthu and Karthika Kumarasamy «Domination Stable Graphs»
|
Производитель: "LAP Lambert Academic Publishing" The literature on changing and unchanging domination number discusses about the changes in the minimum dominating set on a graph by vertex, edge addition and deletion. Edge contraction and edge subdivision are in some sense duals of each other. In the former case the number of vertices is reduced by one and the number of edges is reduced at least by one while,- in the latter case the number of vertices and edges is increased by one. This property of the two graph operations provide a scope to study and compare when and how the minimum dominating set of a graph does not change, on applying these graph operations. This book is dedicated entirely to introduce and explore the stable property of the minimum dominating set of a graph G with respect to the two graph operations. It also relates them to Excellent Graphs. This book would be of interest to researchers working in domination theory. ISBN:9783659199103 Издательство: "LAP Lambert Academic Publishing" (2012)
ISBN: 9783659199103 |
См. также в других словарях:
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
Economic Affairs — ▪ 2006 Introduction In 2005 rising U.S. deficits, tight monetary policies, and higher oil prices triggered by hurricane damage in the Gulf of Mexico were moderating influences on the world economy and on U.S. stock markets, but some other… … Universalium
Business and Industry Review — ▪ 1999 Introduction Overview Annual Average Rates of Growth of Manufacturing Output, 1980 97, Table Pattern of Output, 1994 97, Table Index Numbers of Production, Employment, and Productivity in Manufacturing Industries, Table (For Annual… … Universalium
Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
