An intermediate value theorem for the decycling numbers of Toeplitz graphs

DOI10.1007/S00373-014-1492-3zbMATH Open1328.05100OpenAlexW2084973721MaRDI QIDQ897228FDOQ897228

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2186982
• Decycling connected regular graphs
• Decycling Cartesian Products of Two Cycles
• Decycling graphs
• New formulae for the decycling number of graphs

zbMATH Keywords

Cayley graphsdecycling numberintermediate value theoremToeplitz graphs

Mathematics Subject Classification ID

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

Cites Work

• Decycling graphs
• Hamiltonian properties of Toeplitz graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphs of semigroups
• Switchings, realizations, and interpolation theorems for graph parameters
• Interpolation theorems for graphs, hypergraphs and matroids
• A generalization of the concept of Toeplitz graphs
• Information rates of autoregressive processes

Cited In (1)

• Graphs isomorphisms under edge-replacements and the family of amoebas

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

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