An intermediate value theorem for the decycling numbers of Toeplitz graphs

DOI10.1007/s00373-014-1492-3zbMath1328.05100OpenAlexW2084973721MaRDI QIDQ897228

N. E. Zubov

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1492-3

zbMATH Keywords

Cayley graphsdecycling numberintermediate value theoremToeplitz graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (1)

Graphs isomorphisms under edge-replacements and the family of amoebas

Cites Work

• Hamiltonian properties of Toeplitz graphs
• Interpolation theorems for graphs, hypergraphs and matroids
• Switchings, realizations, and interpolation theorems for graph parameters
• Graphs of semigroups
• Decycling graphs
• Information rates of autoregressive processes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An intermediate value theorem for the decycling numbers of Toeplitz graphs