The path-pairability number of product of stars

DOI10.7151/dmgt.2114zbMath1415.05094OpenAlexW2808296941WikidataQ129687002 ScholiaQ129687002MaRDI QIDQ2312071

Adam S. Jobson, Gábor Mészáros, André E. Kézdy, Jenő Lehel

Publication date: 4 July 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2114

zbMATH Keywords

telecommunications networkCartesian productpath-pairabilitystar-like networkweak linkage

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Paths and cycles (05C38) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

On path-pairability of the finite grids ⋮ Path-pairability of infinite planar grids

Cites Work

• Note on terminal-pairability in complete grid graphs
• On path-pairability in the Cartesian product of graphs
• A sufficient condition for graphs to be weakly \(k\)-linked
• Three-regular path pairable graphs
• On path-pairability of the finite grids
• Networks communicating for each pairing of terminals
• Unnamed Item

This page was built for publication: The path-pairability number of product of stars