Prime factorization and domination in the hierarchical product of graphs

DOI10.7151/dmgt.1952zbMath1375.05208OpenAlexW2582933200MaRDI QIDQ2409781

Sarah E. Anderson, A. Tenney, Y. Guob, K. A. Wash

Publication date: 13 October 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1952

zbMATH Keywords

Cartesian productgeneralized hierarchical productprime factor decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Distinguishing number of hierarchical products of graphs ⋮ Domination in the hierarchical product and Vizing's conjecture ⋮ Some binary products and integer linear programming for \(k\)-metric dimension of graphs ⋮ Distribution of global defensive \(k\)-alliances over some graph products ⋮ Edge metric dimensions via hierarchical product and integer linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Graph multiplication
• The hierarchical product of graphs
• The generalized hierarchical product of graphs
• On graphs having domination number half their order
• Products of graceful trees
• Relations between packing and covering numbers of a tree
• Vizing's conjecture: a survey and recent results
• On the domination of the products of graphs II: Trees
• A new graph product and its spectrum
• The Structure and Function of Complex Networks
• Strong metric dimension of rooted product graphs