Diametral path graphs

DOI10.1007/3-540-60618-1_87MaRDI QIDQ6122236zbMATH OpenOpenAlexFDO

Authors Jitender Deogun, Dieter Kratsch

Publication date 28 February 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60618-1_87

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Decomposition of graph into diametral paths
• Dominating Pair Graphs
• Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
• Hereditary dominating pair graphs
• scientific article; zbMATH DE number 1247724

Cites work

• A linear time algorithm to compute a dominating path in an AT-free graph
• A survey of integrity
• Diameters in graphs
• Dominating cliques in chordal graphs
• Domination on Cocomparability Graphs
• Graph theory with applications
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 3794103 (Why is no real title available?)
• Permutation graphs: Connected domination and Steiner trees

Cited in

(5)

• On the minimum eccentricity shortest path problem
• Asteroidal sets and dominating paths
• Corrigendum to: ``The diameter of AT-free graphs
• On the complexity of rainbow vertex colouring diametral path graphs
• Main eigenvalues for normal matrices and mixed graphs

This page was built for publication: Diametral path graphs

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