Every cubic cage is quasi 4-connected
Copyright policy )Every cubic cage is quasi 4-connected
A \((\delta, g)\)-cage is a regular graph of degree \(\delta\) and girth \(g\) with the least possible number of vertices. In the cited literature it has been proved that every \((3,g)\)-cage is 3-connected and it has been conjectured that all \((\delta, g)\)-cages are \(\delta\)-connected for every \(\delta\geq 3\). The authors further study this hypothesis and prove that every \((3,g)\)-cage with \(g\geq 5\) is quasi 4-connected.
Superconnectivity, Connectivity, Extremal problems in graph theory, Quasi 4-connected graph, cage, cutset, superconnectivity, Theoretical Computer Science, Cage, connectivity, quasi 4-connected graph, Discrete Mathematics and Combinatorics, Cutset
Superconnectivity, Connectivity, Extremal problems in graph theory, Quasi 4-connected graph, cage, cutset, superconnectivity, Theoretical Computer Science, Cage, connectivity, quasi 4-connected graph, Discrete Mathematics and Combinatorics, Cutset
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).8 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!