Large holes in quasi-random graphs.

Polcyn, Joanna

Displaying similar documents to “Large holes in quasi-random graphs.”

On regular factors in regular graphs with small radius.

Hoffmann, Arne, Volkmann, Lutz (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Regular spanning subgraphs of bipartite graphs of high minimum degree.

Csaba, Béla (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Smallest Regular Graphs of Given Degree and Diameter

Martin Knor (2014)

Discussiones Mathematicae Graph Theory

Similarity:

In this note we present a sharp lower bound on the number of vertices in a regular graph of given degree and diameter.

A characterization for sparse $ε$ -regular pairs.

Gerke, Stefanie, Steger, Angelika (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Metrically regular square of metrically regular bigraphs. I

Vladimír Vetchý (1991)

Archivum Mathematicum

Similarity:

A short proof of a theorem of Kano and Yu on factors in regular graphs.

Volkmann, Lutz (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On strongly regular graphs with m2 = qm3 and m3 = qm2

Lepovic, Mirko (2011)

Serdica Mathematical Journal

Similarity:

2010 Mathematics Subject Classification: 05C50. We say that a regular graph G of order n and degree r і 1 (which is not the complete graph) is strongly regular if there exist non-negative integers t and q such that |SiЗSj| = t for any two adjacent vertices i and j, and |SiЗSj| = q for any two distinct non-adjacent vertices i and j, where Sk denotes the neighborhood of the vertex k. Let l1 = r, l2 and l3 be the distinct eigenvalues of a connected strongly regular graph. Let...

Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number

D. M. Cardoso, D. Cvetković (2006)

Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques

Similarity: