The connected 3-regular (cubic) simple graphs are listed for small vertex numbers.

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- Saieed Akbari, Amir Hossein Ghodrati, Mohammad Ali Hosseinzadeh, Ali Iranmanesh
- Journal of Graph Theory
- 2018

A graph is called equimatchable if all of its maximal matchings have the same size. Kawarabayashi, Plummer, and Saito showed thatâ€¦Â (More)

Is this relevant?

2017

2017

- Jennifer Diemunsch, Nathan Graber, +6 authors Charlie Suer
- Discrete Applied Mathematics
- 2017

Let c : E(G) â†’ [k] be an edge-coloring of a graph G, not necessarily proper. For each vertex v, let cÌ„(v) = (a1, . . . , akâ€¦Â (More)

Is this relevant?

2012

2012

- Hyonju Yu
- Des. Codes Cryptography
- 2012

In this paper, we give infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in halfâ€¦Â (More)

Is this relevant?

Review

2008

Review

2008

- MIGHTY XLVII, B. E. Tenner, +25 authors Eddie Cheng
- 2008

A vertex k-coloring of a graph G is distinguishing if the only automorphism of G that preserves the colors is the identity mapâ€¦Â (More)

Is this relevant?

1999

1999

- Robert J. Brooks, ERAN MAKOVER, Walter Neumann
- 1999

We present a collection of results whose central theme is that the phenomenon of the first eigenvalue of the Laplacian beingâ€¦Â (More)

Is this relevant?