The eavesdropping number of a graph

DOI10.1007/s10587-009-0056-9zbMath1224.05273OpenAlexW2060146993MaRDI QIDQ3070149

Jeffrey L. Stuart

Publication date: 2 February 2011

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/37947

zbMATH Keywords

Cartesian productedge connectivityvertex disjoint pathseavesdropping numbermaximally locally connected

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Unnamed Item
• Connectivity of Cartesian product graphs
• The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices
• Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs

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