Zobrazeno 1 - 4
of 4
pro vyhledávání: '"05C35, 51E15"'
Autor:
Araujo-Pardo, Gabriela, Conder, Marston, García-Colín, Natalia, Kiss, György, Leemans, Dimitri
In this paper, we introduce a problem closely related to the Cage Problem and the Degree Diameter Problem. For integers $k\geq 2$, $g\geq 3$ and $d\geq 1$, we define a $(k;\, g,d)$-graph to be a $k$-regular graph with girth $g$ and diameter $d$. We d
Externí odkaz:
http://arxiv.org/abs/2401.15539
Autor:
Araujo-Pardo, Gabriela, López, Nacho
The modelling of interconnection networks by graphs motivated the study of several extremal problems that involve well known parameters of a graph (degree, diameter, girth and order) and ask for the optimal value of one of them while holding the othe
Externí odkaz:
http://arxiv.org/abs/2005.02427
We prove an upper bound for the number of edges a C4-free graph on q^2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q.
Comment: 9 pages
Comment: 9 pages
Externí odkaz:
http://arxiv.org/abs/1201.4912
We prove an upper bound for the number of edges a C4-free graph on q^2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q.
Comment: 9 pages
Comment: 9 pages
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a28f0235aef6bef8e0b8a5cfd650694c