The eavesdropping number of a graph

DOI10.1007/S10587-009-0056-9MaRDI QIDQ3070149zbMATH OpenOpenAlexFDO

Authors Jeffrey 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, http://hdl.handle.net/10338.dmlcz/140505

zbMATH Keywords

Cartesian productedge connectivityvertex disjoint pathseavesdropping numbermaximally locally connected

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Minimal separating sets of maximum size
• scientific article; zbMATH DE number 3916308
• The average connectivity of a graph
• Edge Eavesdropping Games
• scientific article; zbMATH DE number 786178

Cites work

• scientific article; zbMATH DE number 2192129 (Why is no real title available?)
• Connectivity of Cartesian product graphs
• Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs
• The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070149)