Distance formula for direct-co-direct product in the case of disconnected factors

DOI10.26493/2590-9770.1508.8B5MaRDI QIDQ5888905zbMATH OpenOpenAlexFDO

Authors Aleksander Kelenc, Iztok Peterin

Publication date 25 April 2023

Published in The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/2590-9770.1508.8b5

zbMATH Keywords

direct-co-direct productdisconnected graphsdistanceeccentricity

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Distance regularity in direct-product graphs
• On the connectivity of the direct product of graphs
• Distance product of graphs
• Exact distance graphs of product graphs
• Strongly distance-balanced graphs and graph products

Cites work

• Counterexamples to Hedetniemi's conjecture
• Direct product of automorphism groups of digraphs
• Factoring cardinal product graphs in polynomial time
• Handbook of product graphs
• scientific article; zbMATH DE number 139936 (Why is no real title available?)
• scientific article; zbMATH DE number 3614188 (Why is no real title available?)
• scientific article; zbMATH DE number 2192181 (Why is no real title available?)
• scientific article; zbMATH DE number 3385666 (Why is no real title available?)
• On Cartesian skeletons of graphs
• On the action of non-Abelian groups on graphs
• Recognizing Cartesian products in linear time
• The Kronecker Product of Graphs
• Vizing's conjecture: a survey and recent results

Cited in

(2)

• Domination number of modular product graphs
• On distance and strong metric dimension of the modular product

This page was built for publication: Distance formula for direct-co-direct product in the case of disconnected factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5888905)