On the Injective Equitable Domination of Graphs
According to Goddard and Henning , it is not known if the bound for planar diameter-3 graphs is sharp, but MacGillivray and Seyffarth gave an example of such of graph with domination number 6. The total domination number and ordinary domination number satisfy. Precomputed dominating sets for many named graphs can be obtained in the Wolfram Language using GraphData [ graph , "DominationNumber" ].
The following table summarizes values of the domination number for various special classes of graphs. Portions of this entry contributed by Nicolas Bray. Alikhani, S.
Domination in Graphs: Advanced Topics
Clark, W. Combinatorics 7 , No. Garey, M. New York: W.
Freeman, p. Goddard, W.
Henning, M. Graph Th.
Haynes, T. Includes chapters on domination algorithms and NP-completeness as well as frameworks for domination. Bounds on the Domination Number. Domination Independence and Irredundance. Efficiency Redundancy and Their Duals. Changing and Unchanging Domination. Conditions on the Dominating Set.
Nav view search
Varieties of Domination. Condition: New.
Seller Inventory More information about this seller Contact this seller. Never used!. Seller Inventory P Brand new book, sourced directly from publisher.
- Krav Maga for Women: Your Ultimate Program for Self Defense.
- Whisky Words;
- Uncommon Revolutionary: A Story About Thomas Paine (Creative Minds Biographies)?
- Graphs with large paired-domination number!
- Apache Adaptation to Hispanic Rule.
Dispatch time is working days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Condition: NEW. For all enquiries, please contact Herb Tandree Philosophy Books directly - customer service is our primary goal.
Book Description Marcel Dekker Inc, Condition: Brand New. In Stock. Ships with Tracking Number! Buy with confidence, excellent customer service!.