On the monotonicity of \((k;g,h)\)-graphs (Q1862823): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s102550200048 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2053148324 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connectivity of cages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regular graphs with given girth pair / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5785712 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5461548 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cages—a survey / rank | |||
Normal rank |
Latest revision as of 14:06, 5 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the monotonicity of \((k;g,h)\)-graphs |
scientific article |
Statements
On the monotonicity of \((k;g,h)\)-graphs (English)
0 references
22 June 2003
0 references
A \(k\)-regular graph with girth \(g\) is called a \((k;g)\)-graph. A \((k;g)\)-cage is a \((k;g)\)-graph with the least possible number of vertices. The number of vertices of a \((k;g)\)-cage is denoted by \(f(k;g)\). The odd and even girths of a graph \(G\) are the lengths of a shortest odd and even cycle of \(G\) respectively. A \(k\)-regular graph with odd and even girths \(g\) and \(h\) (\(g\) is the smaller of the numbers of odd and even girths) is called a \((k;g,h)\)-graph. A \((k;g,h)\)-cage is a \((k;g,h)\)-graph with the least possible number of vertices. The number of vertices of a \((k;g,h)\)-cage is denoted by \(f(k;g,h)\). It is proved that \(f(k;h-1,h)<f(k;h)\) for \(k\geq 3, h\geq 4\). This result strengthens an inequality proved by \textit{F. Harary} and \textit{P. Kovács} [J. Graph Theory 7, 209-218 (1983; Zbl 0542.05041)].
0 references
cages graph
0 references
regular graph
0 references
odd girth
0 references
even girth
0 references