The cutting center theorem for trees
From MaRDI portal
Publication:2544371
DOI10.1016/0012-365X(71)90003-3zbMath0211.57201OpenAlexW2015126386MaRDI QIDQ2544371
Frank Harary, Phillip A. Ostrand
Publication date: 1971
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(71)90003-3
Related Items (11)
A COHESION INDEX FOR COOPERATION GRAPHS ⋮ On bounds for the cutting number of a graph ⋮ The \(k\)-ball \(l\)-path branch weight centroid ⋮ Boolean distance for graphs ⋮ SOME CENTRALITY RESULTS NEW AND OLD ⋮ A linear algorithm for the cutting center of a tree ⋮ Betweenness Centrality: Extremal Values and Structural Properties ⋮ A note on balance vertices in trees ⋮ The expected number of pairs of connected nodes: Pair-connected reliability ⋮ Cutting numbers for the forward loop backward hop network ⋮ Cutting numbers in graphs
Cites Work
This page was built for publication: The cutting center theorem for trees
