Edge erasures and chordal graphs

DOI10.5614/ejgta.2021.9.2.13zbMath1481.05065arXiv1706.04537OpenAlexW3205665626MaRDI QIDQ5061692

Dan P. Guralnik, Peter F. Stiller, Jared Culbertson

Publication date: 14 March 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

weighted graphschordal graphsminimum spanning treesKruskal's algorithmexposed edgesedge erasures

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) General theory of distance geometry (51K05) Simple homotopy type, Whitehead torsion, Reidemeister-Franz torsion, etc. (57Q10) Signed and weighted graphs (05C22)

Related Items

Completing and Extending Shellings of Vertex Decomposable Complexes

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Statistical properties of the single linkage hierarchical clustering estimator
• On rigid circuit graphs
• Algebraic properties of edge ideals via combinatorial topology
• Functorial hierarchical clustering with overlaps
• Algorithms for weakly triangulated graphs
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
• Incidence matrices and interval graphs
• Topology and data
• Clique roots of K4-free chordal graphs
• Simple Homotopy Types