Associative graph products and their independence, domination and coloring numbers
From MaRDI portal
Publication:2785650
DOI10.7151/dmgt.1023zbMath0865.05071OpenAlexW1969794347MaRDI QIDQ2785650
Douglas F. Rall, Richard J. Nowakowski
Publication date: 29 June 1997
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1023
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items (max. 100)
Fractional dominations and fractional total dominations of graph complements ⋮ Graph products of the trivariate total domination polynomial and related polynomials ⋮ Acyclic colorings of products of trees ⋮ Connectivity and other invariants of generalized products of graphs ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ DOMINATION AND DOMATIC NUMBERS OF INVOLUTORY CAYLEY GRAPH ⋮ Domination and upper domination of direct product graphs ⋮ Bondage number of the strong product of two trees ⋮ Dominating direct products of graphs ⋮ \(k\)-tuple total domination in cross products of graphs ⋮ The total co-independent domination number of some graph operations ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ Total Roman domination in the lexicographic product of graphs ⋮ On the super domination number of lexicographic product graphs ⋮ On the weak Roman domination number of lexicographic product graphs ⋮ Bondage number of strong product of two paths ⋮ On independent domination in direct products ⋮ On some metric properties of direct-co-direct product ⋮ Unimodality and monotonic portions of certain domination polynomials ⋮ From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ On the roman domination in the lexicographic product of graphs ⋮ Gromov hyperbolicity in the Cartesian sum of graphs ⋮ Upper bounds on the bondage number of the strong product of a graph and a tree ⋮ Dominating sequences in grid-like and toroidal graphs ⋮ Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs ⋮ Lower bounds for the domination number and the total domination number of direct product graphs ⋮ Smallest independent dominating sets in Kronecker products of cycles ⋮ Domination related parameters in the generalized lexicographic product of graphs ⋮ A survey of selected recent results on total domination in graphs ⋮ Tightness of domination inequalities for direct product graphs ⋮ On the 2-packing differential of a graph ⋮ Independence number of generalized products of graphs ⋮ On the acyclic chromatic number of Hamming graphs ⋮ Closed formulas for the total Roman domination number of lexicographic product graphs ⋮ Protection of lexicographic product graphs ⋮ On the total \(\{k\}\)-domination number of Cartesian products of graphs ⋮ Double domination in lexicographic product graphs ⋮ Vizing's conjecture: a survey and recent results ⋮ On well-dominated direct, Cartesian and strong product graphs ⋮ On maximum independent set of categorical product and ultimate categorical ratios of graphs ⋮ On well-covered direct products
This page was built for publication: Associative graph products and their independence, domination and coloring numbers
