Opening book details…
Can I read New Families of Graphs Without Short Cycles and Large Size on EtoBox?
New Families of Graphs Without Short Cycles and Large Size by E. Abajo; C. Balbuena; A. Diánez is a Computer Science article available to read on EtoBox.
What is New Families of Graphs Without Short Cycles and Large Size about?
## a b s t r a c t We denote by ex(n; {C 3 , C 4 , . . . , C s }) or f s (n) the maximum number of edges in a graph of order n and girth at least s + 1. First we give a method to transform an n-vertex graph of girth g into a graph of girth at least g -1 on fewer vertices. For an infinite sequence of values of n and s ∈ {4, 6, 10} the obtained graphs are denser than the known constructions of graphs of the same girth s + 1. We also give another different construction of dense graphs for an infinite sequence of values of n and s ∈ {7, 11}. These two methods improve the known lower bounds on f s (n) for s ∈ {4, 6, 7, 10, 11} which were obtained using different algorithms. Finally, to know how good are our results, we have proved that 7, 11}, and s -1-2 s ≤ lim sup n→∞ fs(n) n 1+ 2 s ≤ 0.5 for s ∈ {6, 10}.
Who reads New Families of Graphs Without Short Cycles and Large Size?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- E. Abajo; C. Balbuena; A. Diánez
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)
- Published
- 2010
- Language
- EN
- Field
- Computer Science (Physical Sciences)