The hub number of a graph

DOI10.1016/j.ipl.2008.05.022zbMath1189.05163OpenAlexW2102299824MaRDI QIDQ975457

Lesley Wiglesworth, Pratik Worah, Stephen G. Hartke, Bill Kinnersley, Douglas B. West, Hehui Wu, Tracy Grauman, Adam S. Jobson

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.022

zbMATH Keywords

complexitygraph algorithmsconnected dominationhub sethub number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (8)

Some operations in hub-integrity of graphs ⋮ Unnamed Item ⋮ The hub number of Sierpiński-like graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ The hub number, girth and Mycielski graphs ⋮ Structural properties of subdivided-line graphs ⋮ The hub number of co-comparability graphs ⋮ The connected hub number and the connected domination number

Cites Work

• Routing sets in the integer lattice
• Algorithms – ESA 2004
• Unnamed Item

This page was built for publication: The hub number of a graph