A table of connected graphs on six vertices
From MaRDI portal
Cites work
- Cubic graphs on \(\leq 14\) vertices
- Generalized line graphs
- scientific article; zbMATH DE number 3825855 (Why is no real title available?)
- scientific article; zbMATH DE number 3657843 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3737716 (Why is no real title available?)
- On spectral characterization and embeddings of graphs
- Parallel concepts in graph theory
Cited in
(87)- Unicyclic graphs with exactly two main eigenvalues
- Spectra of unicyclic graphs
- On Hamiltonian graphs with maximal index
- A note on the irregularity of graphs
- The maximal exceptional graphs
- On the spectral radius of unicyclic graphs with perfect matchings
- Inertia and biclique decompositions of joins of graphs
- On unicyclic graphs whose second largest eigenvalue does not exceed 1
- Complementarity eigenvalue analysis of connected graphs
- New families of graphs determined by their generalized spectrum
- Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem
- On the index of bicyclic graphs with perfect matchings
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- Unicyclic graphs with maximal energy
- Graphs with least eigenvalue -2; a historical survey and recent developments in maximal exceptional graphs
- Skew rank decompositions
- The majorization theorem for signless Laplacian spectral radii of connected graphs
- On extendability of co-edge-regular graphs
- Graphs with \(n - 1\) main eigenvalues
- Link dimension and exact construction of graphs from distance vectors
- Unlocking the walk matrix of a graph
- Ordering starlike trees by the totality of their spectral moments
- The H-join of arbitrary families of graphs -- the universal adjacency spectrum
- On graphic elementary lifts of graphic matroids
- Which graphs occur as \(\gamma\)-graphs?
- Triameter of graphs
- Welfare targeting in networks
- Some new aspects of main eigenvalues of graphs
- Classifying character degree graphs with six vertices
- Eigenvalue multiplicity in regular graphs
- On the largest eigenvalue of non-regular graphs
- Eigenvalue multiplicity in quartic graphs
- On coherence of graph products of groups and Coxeter groups
- Star complements and connectivity in finite graphs
- On bicyclic graphs whose second largest eigenvalue does not exceed 1
- Ideal Whitehead graphs in \(\mathrm{Out}(F_r)\). III: Achieved graphs in rank 3
- On the spectral moment of graphs with given clique number
- Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
- On strongly asymmetric and controllable primitive graphs
- On the Laplacian energy of a graph
- MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS
- Functions on adjacent vertex degrees of trees with given degree sequence
- On the spectrum of threshold graphs
- 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 eccentric connectivity index of unicyclic graphs
- Developments in the theory of graph spectra
- Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2
- Star partitions and the graph isomorphism problem
- Graphs with least eigenvalue -2: ten years on
- On graphs with exactly three Q-main eigenvalues
- On the number of maximum independent sets of graphs
- The spectral moments of trees with given maximum degree
- On the least eigenvalue of cacti
- On eigenvalue multiplicity and the girth of a graph
- The spread of unicyclic graphs with given size of maximum matchings
- A note on Hoffman-type identities of graphs
- Graphs with least eigenvalue -2: The star complement technique
- Circulant graphs with \(\det(-A(G))=-\deg(G)\): Codeterminants with \(K_n\)
- Lexicographical ordering by spectral moments of trees with a prescribed diameter
- Number of cycles of small length in a graph
- Graphs for small multiprocessor interconnection networks
- On regular graphs equienergetic with their complements
- On the skew spectral moments of trees and unicyclic graphs
- Integral Laplacian graphs with a unique repeated Laplacian eigenvalue. I
- Ordering unicyclic graphs in terms of their smaller least eigenvalues
- Primary non-QE graphs on six vertices
- Complementary _1-graphs and related combinatorial structures
- On non-bipartite graphs with strong reciprocal eigenvalue property
- On the spectral moment of quasi-trees
- Insights into the structured coordination game with neutral options through simulation
- Which graphs are determined by their total number of walks?
- The graphs of pyramids are determined by their spectrum
- The walks and CDC of graphs with the same main eigenspace
- Primitive, edge-short, isometric, and pantochordal cycles
- Integral Laplacian graphs with a unique repeated Laplacian eigenvalue. II
- Spectral properties of generalized Paley graphs
- Signless Laplacian characterization of cones over disjoint unions of cycles, edges and isolated vertices
- The spectral moments of hypertrees and unicyclic hypergraphs
- The ordering of hypertrees and unicyclic hypergraphs by the traces of \(\mathcal{A} \alpha\)-tensor
- Bicyclic graphs with exactly two main eigenvalues
- Eigenvalue multiplicity in triangle-free graphs
- Graphs for which the least eigenvalue is minimal. I
- Graphs for which the least eigenvalue is minimal. II.
- Main eigenvalues and \((\kappa ,\tau )\)-regular sets
- Spectral upper bounds for the order of a \(k\)-regular induced subgraph
- Bicyclic graphs for which the least eigenvalue is minimum
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)
