Modular decomposition of graphs and the distance preserving property

DOI10.1016/j.dam.2019.03.019zbMath1416.05237arXiv1805.09853OpenAlexW2804854919MaRDI QIDQ2312661

Jason P. Smith, Emad Zahedi

Publication date: 17 July 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.09853

zbMATH Keywords

Cartesian productmodular decompositionlexicographic productisometricdistance preserving

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
• A survey of the algorithmic aspects of modular decomposition
• Convex sets in lexicographic products of graphs
• The PI index of product graphs
• Distance-hereditary graphs
• Cartesian graph factorization at logarithmic cost per edge
• On the chromatic number of the lexicographic product and the Cartesian sum of graphs
• On certain polytopes associated with graphs
• A characterization of perfect graphs
• On the Metric Dimension of Cartesian Products of Graphs
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• Distance preserving graphs and graph products
• On Constructing Regular Distance-Preserving Graphs
• Transitiv orientierbare Graphen
• Some new results on distance-based graph invariants

This page was built for publication: Modular decomposition of graphs and the distance preserving property