On bounds for the cutting number of a graph

DOI10.1007/s13226-012-0038-8zbMath1269.05066OpenAlexW2048160089MaRDI QIDQ2392551

Senelani D. Hove-Musekwa, Simon Mukwembi

Publication date: 1 August 2013

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13226-012-0038-8

zbMATH Keywords

networkdiametercentralitycutting number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• A linear algorithm for the cutting center of a tree
• The centrality index of a graph
• The cutting center theorem for trees
• A faster algorithm for betweenness centrality*
• A self-stabilizing graph algorithm: Finding the cutting center of a tree
• SOME CENTRALITY RESULTS NEW AND OLD
• Cutting numbers in graphs

This page was built for publication: On bounds for the cutting number of a graph