A table of connected graphs on six vertices
From MaRDI portal
Publication:789413
DOI10.1016/0012-365X(84)90033-5zbMATH Open0533.05052OpenAlexW2053561526MaRDI QIDQ789413
Dragoš Cvetković, Milenko Petrić
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(84)90033-5
Cites Work
Cited In (77)
- Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem
- Functions on adjacent vertex degrees of trees with given degree sequence
- MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS
- On the spectrum of threshold graphs
- Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
- A note on the irregularity of graphs
- Star complements and connectivity in finite graphs
- On the Laplacian energy of a graph
- The spread of unicyclic graphs with given size of maximum matchings
- A note on Hoffman-type identities of graphs
- Some new aspects of main eigenvalues of graphs
- The maximal exceptional graphs
- On Hamiltonian graphs with maximal index
- Graphs for which the least eigenvalue is minimal. I
- On the spectral moment of graphs with given clique number
- Lexicographical ordering by spectral moments of trees with \(k\) pendant vertices and integer partitions
- On the spectral moments of unicyclic graphs with fixed diameter
- On the spectral radius of unicyclic graphs with perfect matchings
- Star partitions and the graph isomorphism problem
- The spectral moments of trees with given maximum degree
- Eigenvalue multiplicity in regular graphs
- Unicyclic graphs with maximal energy
- Lexicographical ordering by spectral moments of trees with a prescribed diameter
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- On the spectral moment of quasi-trees
- Eigenvalue multiplicity in quartic graphs
- The majorization theorem for signless Laplacian spectral radii of connected graphs
- On unicyclic graphs whose second largest eigenvalue does not exceed 1
- Graphs with least eigenvalue \(-2\): The star complement technique
- On graphic elementary lifts of graphic matroids
- On the least eigenvalue of cacti
- Graphs for which the least eigenvalue is minimal. II.
- Spectra of unicyclic graphs
- On the index of bicyclic graphs with perfect matchings
- Ordering unicyclic graphs in terms of their smaller least eigenvalues
- On extendability of co-edge-regular graphs
- On strongly asymmetric and controllable primitive graphs
- Main eigenvalues and \((\kappa ,\tau )\)-regular sets
- On the largest eigenvalue of non-regular graphs
- Number of cycles of small length in a graph
- Eigenvalue multiplicity in triangle-free graphs
- On bicyclic graphs whose second largest eigenvalue does not exceed 1
- Bicyclic graphs with exactly two main eigenvalues
- Unicyclic graphs with exactly two main eigenvalues
- Graphs with least eigenvalue \(-2\): ten years on
- On eigenvalue multiplicity and the girth of a graph
- On graphs with exactly three Q-main eigenvalues
- Welfare targeting in networks
- Developments in the theory of graph spectra
- Complementarity eigenvalue analysis of connected graphs
- Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs
- Graphs for small multiprocessor interconnection networks
- Spectral upper bounds for the order of a \(k\)-regular induced subgraph
- Bicyclic graphs for which the least eigenvalue is minimum
- Which graphs occur as \(\gamma\)-graphs?
- On the Eccentric Connectivity Index of Unicyclic Graphs
- Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2
- New families of graphs determined by their generalized spectrum
- Inertia and biclique decompositions of joins of graphs
- Graphs with \(n - 1\) main eigenvalues
- Title not available (Why is that?)
- Complementary \(\ell_1\)-graphs and related combinatorial structures
- Title not available (Why is that?)
- On coherence of graph products of groups and Coxeter groups
- On regular graphs equienergetic with their complements
- Ordering starlike trees by the totality of their spectral moments
- The \(H\)-join of arbitrary families of graphs -- the universal adjacency spectrum
- Ideal Whitehead graphs in \(\mathrm{Out}(F_r)\). III: Achieved graphs in rank 3
- Unlocking the walk matrix of a graph
- On non-bipartite graphs with strong reciprocal eigenvalue property
- Skew rank decompositions
- Integral Laplacian graphs with a unique repeated Laplacian eigenvalue. I
- Circulant graphs with \(\det(-A(G))=-\deg(G)\): Codeterminants with \(K_n\)
- Link dimension and exact construction of graphs from distance vectors
- Triameter of graphs
- Primary non-QE graphs on six vertices
- Classifying character degree graphs with six vertices
This page was built for publication: A table of connected graphs on six vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q789413)
