The integrity of a cubic graph

DOI10.1016/j.dam.2003.07.002zbMath1069.90018OpenAlexW2036329881MaRDI QIDQ1827848

Andrew Vince

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.07.002

zbMATH Keywords

network reliabilityintegrity

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items (10)

A feedback vertex set of 2-degenerate graphs ⋮ Largest component and node fault tolerance for grids ⋮ Safe number and integrity of graphs ⋮ A note on the integrity of grids ⋮ Spectral bounds for the vulnerability parameters of graphs ⋮ On the range of possible integrities of graphs \(G(n, k)\) ⋮ Network majority on tree topological network ⋮ Feedback vertex sets in cubic multigraphs ⋮ New lower bounds on the size-Ramsey number of a path ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for the weighted feedback vertex problem on interval graphs
• On the maximum induced forests of a connected cubic graph without triangles
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Large induced degenerate subgraphs
• Ramanujan graphs
• Eigenvalues and expanders
• On locating minimum feedback vertex sets
• Almost exact minimum feedback vertex set in meshes and butterflies
• A survey of integrity
• Cubic Ramanujan graphs
• Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
• Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
• Large induced forests in sparse graphs
• Lower Bounds For Induced Forests in Cubic Graphs
• On feedback vertex sets and nonseparating independent sets in cubic graphs
• Decycling graphs

This page was built for publication: The integrity of a cubic graph