Asymptotically large (,D)-graphs
From MaRDI portal
Publication:2576342
DOI10.1016/J.DAM.2005.03.008zbMATH Open1080.05027OpenAlexW1974840557MaRDI QIDQ2576342FDOQ2576342
Authors: Eduardo A. Canale, J. Gomez 
Publication date: 27 December 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.03.008
Recommendations
Cites Work
- Title not available (Why is that?)
- Line Digraph Iterations and the (d, k) Digraph Problem
- Title not available (Why is that?)
- The diameter of random regular graphs
- Title not available (Why is that?)
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- Graphs on alphabets as models for large interconnection networks
- Large graphs with given degree and diameter. II
- A note on constructing large Cayley graphs of given degree and diameter by voltage assignments
Cited In (16)
- $t$-Strong Cliques and the Degree-Diameter Problem
- A lower bound for the spectral radius of graphs with fixed diameter
- Trade-offs among degree, diameter, and number of paths
- The degree-diameter problem for sparse graph classes
- Sufficient conditions for maximally connected dense graphs
- Large Graphs with Given Degree and Diameter—Part I
- Approximate Moore graphs are good expanders
- \(t\)-strong cliques and the degree-diameter problem
- The degree-diameter problem for claw-free graphs and hypergraphs
- Asymptotically optimal \((\Delta, D', s)\)-digraphs
- Large k‐preserving sets in infinite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The asymptotics of large constrained graphs
- Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
- Maximizing Line Subgraphs of Diameter at Most t
This page was built for publication: Asymptotically large (\(\Delta,D\))-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576342)
