Eccentricity Approximating Trees

DOI10.1007/978-3-662-53536-3_13zbMath1417.05029OpenAlexW2524847762MaRDI QIDQ3181054

H. Alrasheed, Feodor F. Dragan, Ekkehard Köhler

Publication date: 22 December 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-662-53536-3_13

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Eccentricity approximating trees

Cites Work

• Unnamed Item
• Tree 3-spanners on interval, permutation and regular bipartite graphs
• Centers of triangulated graphs
• On local convexity in graphs
• Eccentricity-approximating trees in chordal graphs
• Graphs of some CAT(0) complexes
• Conditions for invariance of set diameters under d-convexification in a graph
• Distance Approximating Trees for Chordal and Dually Chordal Graphs
• 1-Hyperbolic Graphs
• Additive Tree Spanners

This page was built for publication: Eccentricity Approximating Trees