Cubic graphs on 14 vertices

DOI10.1016/0095-8956(77)90034-XMaRDI QIDQ1243739zbMATH OpenOpenAlexDBLPWikidataFDO

Authors S. Cobeljic, J. J. Seidel, Bussemaker, Frans C., Dragoš Cvetković

Publication date 1977

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(77)90034-x

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph theory (05C99)

Cited in

(15)

• Spectra of unicyclic graphs
• The structure of trivalent graphs with minimal eigenvalue gap
• Johan Jacob Seidel
• Regular graphs with minimum spectral gap
• On indicated chromatic number of graphs
• How to personalize the vertices of a graph?
• Quartic graphs with minimum spectral gap
• Distance magic labelling of Mycielskian graphs
• Graphs of degree at least \({3}\) with minimum algebraic connectivity
• Critically 3-frustrated signed graphs
• Nonexistence of uniformly most reliable graphs of least corank
• Most reliable graphs with reduced corank
• There are finitely many uniformly most reliable graphs of corank 5
• A table of connected graphs on six vertices
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators

This page was built for publication: Cubic graphs on \(\leq 14\) vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1243739)