A characterization of block graphs

DOI10.1016/J.DAM.2009.09.024zbMATH Open1226.05190OpenAlexW2088004857MaRDI QIDQ968133FDOQ968133

Authors Ali Behtoei, Mohsen Jannesari, Bijan Taeri 

Publication date 5 May 2010

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

Full work available at URL https://doi.org/10.1016/j.dam.2009.09.024

zbMATH Keywords

Wiener indexblock graphs2-connected graphsgraph invariants

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Block graph of a graph
• An observation on block graphs
• Block graphs with unique minimum dominating sets
• Characterizing and recognizing probe block graphs
• Good characterizations and linear time recognition for 2-probe block graphs

Cites Work

• scientific article; zbMATH DE number 809164 (Why is no real title available?)
• Graph theory

Cited In (23)

• Characterizing block graphs in terms of their vertex-induced partitions
• Steiner Wiener index of block graphs
• Wiener index and Steiner 3-Wiener index of graphs
• An observation on block graphs
• Title not available (Why is no real title available?)
• Block graphs in practice
• Confluence number of certain derivative graphs
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Algorithms for connected \(p\)-centdian problem on block graphs
• Extremes of Markov random fields on block graphs: max-stable limits and structured Hüsler-Reiss distributions
• On the Wiener index, distance cospectrality and transmission-regular graphs
• The connected \(p\)-center problem on block graphs with forbidden vertices
• Vertex deletion on split graphs: beyond 4-hitting set
• Leaps: an approach to the block structure of a graph
• On the general position number of the k -th power graphs
• Improved bounds on the difference between the Szeged index and the Wiener index of graphs
• Title not available (Why is no real title available?)
• On the computational complexity of the strong geodetic recognition problem
• \((k+1)\)-line graphs of \(k\)-trees
• Displaying blocking pairs in signed graphs
• The connected \(p\)-centdian problem on block graphs
• Max-linear graphical models with heavy-tailed factors on trees of transitive tournaments

This page was built for publication: A characterization of block graphs

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