Total Domination in Categorical Products of Graphs
From MaRDI portal
Publication:5316256
DOI10.7151/dmgt.1257zbMath1074.05068OpenAlexW2059971470MaRDI QIDQ5316256
Publication date: 12 September 2005
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1257
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
A Taxonomy of Perfect Domination ⋮ Zero-sum flow number of categorical and strong product of graphs ⋮ Dominating direct products of graphs ⋮ Roman domination in direct product graphs and rooted product graphs ⋮ \(k\)-tuple total domination in cross products of graphs ⋮ The total co-independent domination number of some graph operations ⋮ Domination in digraphs and their direct and Cartesian products ⋮ Open packing subdivision number of graphs ⋮ (Open) packing number of some graph products ⋮ Total domination stability in graphs ⋮ Injective coloring of graphs revisited ⋮ Packings in bipartite prisms and hypercubes ⋮ On edge irregular total labeling of categorical product of two cycles ⋮ Total and paired domination numbers of toroidal meshes ⋮ Zero-sum flow number of octagonal grid and generalized prism ⋮ On the \(k\)-limited packing numbers in graphs ⋮ On dominated coloring of graphs and some Nordhaus–Gaddum-type relations ⋮ Lower bounds for the domination number and the total domination number of direct product graphs ⋮ A survey of selected recent results on total domination in graphs ⋮ Domination-related parameters in rooted product graphs ⋮ A note on the open packing number in graphs ⋮ More on limited packings in graphs ⋮ Further results on packing related parameters in graphs
