Pages that link to "Item:Q793749"
From MaRDI portal
The following pages link to Large graphs with given degree and diameter. II (Q793749):
Displaying 41 items.
- The degree-diameter problem for sparse graph classes (Q491538) (← links)
- Large bipartite Cayley graphs of given degree and diameter (Q626783) (← links)
- On large \((\Delta ,D)\)-graphs (Q685678) (← links)
- Constructions of large graphs on surfaces (Q742602) (← links)
- Optimal graphs in the enhanced mesh networks (Q780519) (← links)
- Fault diameter of product graphs (Q846012) (← links)
- Graphs of order two less than the Moore bound (Q924968) (← links)
- Complete catalogue of graphs of maximum degree 3 and defect at most 4 (Q967350) (← links)
- On super edge-connectivity of product graphs (Q1002278) (← links)
- On the 3-restricted edge connectivity of permutation graphs (Q1028132) (← links)
- Sufficient conditions for maximally connected dense graphs (Q1086585) (← links)
- Tables of large graphs with given degree and diameter (Q1164611) (← links)
- The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks (Q1179732) (← links)
- Examples of products giving large graphs with given degree and diameter (Q1199421) (← links)
- Diameters of cubic graphs (Q1199439) (← links)
- Table of large \(({\Delta{}}, D)\)-graphs (Q1199460) (← links)
- A note on large graphs of diameter two and given maximum degree (Q1272472) (← links)
- The connectivity of generalized graph products (Q1751415) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Multidiameters and multiplicities (Q1817589) (← links)
- Maximal cubic graphs with diameter 4 (Q1975363) (← links)
- Vulnerability of super extra edge-connected graphs (Q2009643) (← links)
- On the edge-connectivity and restricted edge-connectivity of a product of graphs (Q2462383) (← links)
- Asymptotically large (\(\Delta,D\))-graphs (Q2576342) (← links)
- Hamilton-connectivity of interconnection networks modeled by a product of graphs (Q2690609) (← links)
- A survey on undirected circulant graphs (Q2905302) (← links)
- New largest known graphs of diameter 6 (Q3057089) (← links)
- On large (Δ, D, D, 1)-graphs (Q3087616) (← links)
- (Q3347920) (← links)
- Separation of Cartesian products of graphs into several connected components by the removal of edges (Q3390790) (← links)
- Highly connected star product graphs (Q3439647) (← links)
- ON EDGE-CONNECTIVITY AND SUPER EDGE-CONNECTIVITY OF INTERCONNECTION NETWORKS MODELED BY PRODUCT GRAPHS (Q3575370) (← links)
- Some large graphs with given degree and diameter (Q3720626) (← links)
- On the unilateral (?,D*)-problem (Q4520240) (← links)
- Large circulant graphs of fixed diameter and arbitrary degree (Q4604515) (← links)
- New large graphs with given degree and diameter (Q4871144) (← links)
- (Q5009641) (← links)
- Some new large (Δ, 3)‐graphs (Q5191122) (← links)
- Two new families of large compound graphs (Q5471084) (← links)
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs (Q5903419) (← links)
- Graphs with many large degrees (Q5946758) (← links)
