Publication:5441572
From MaRDI portal
zbMath1155.05051MaRDI QIDQ5441572
Teresa W. Haynes, Michael A. Henning, Lucas C. Van Der Merwe, Peter J. Slater
Publication date: 15 February 2008
distance; independence number; chromatic number; domination number; complementary prism; complementary product; graph product
05C99: Graph theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Independent strong domination in complementary prisms, Injective coloring of complementary prism and generalized complementary prism graphs, On the General Position Number of Complementary Prisms, A polynomial time algorithm for geodetic hull number for complementary prisms, k-tuple restrained domination in graphs, Some results on the b-chromatic number in complementary prism graphs, Some Cycle and Star Related Nordhaus-Gaddum Type Relations on Strong Effcient Dominating Sets, Unnamed Item, Partitioning a graph into complementary subgraphs, Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms, Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs, The core of a complementary prism, Differential in complementary prisms, The core of a vertex-transitive complementary prism, On the monophonic convexity in complementary prisms, Global dominating broadcast in graphs, Geometric and topological properties of the complementary prism networks, Recognizing some complementary products, \(k\)-tuple total domination in complementary prisms, Complexity properties of complementary prisms, On the bondage, strong and weak bondage numbers in complementary prism graphs, Domination and total domination in complementary prisms, Spectra, signless Laplacian and Laplacian spectra of complementary prisms of graphs, Rainbow disconnection in graphs, On the geodetic number of complementary prisms, Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs, Identifying codes in the complementary prism of cycles, Open-independent, open-locating-dominating sets in complementary prism graphs, A note on the convexity number of the complementary prisms of trees, Perfect matching cuts partitioning a graph into complementary subgraphs, Cycles in complementary prisms, \(k\)-tuple total restrained domination in complementary prisms, Relating the annihilation number and the total domination number for some graphs
