Relationships between symmetry-based graph measures
From MaRDI portal
Cites work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- A history of graph entropy measures
- Algebraic Graph Theory
- Bounds on the moduli of polynomial zeros
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
- Fifty years of graph matching, network alignment and network comparison
- Galois' theory of algebraic equations
- Graph polynomials
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3777779 (Why is no real title available?)
- scientific article; zbMATH DE number 3439834 (Why is no real title available?)
- scientific article; zbMATH DE number 3383473 (Why is no real title available?)
- Introduction to algorithms.
- Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
- On some counting polynomials in chemistry
- On the Classification of Symmetric Graphs with a Prime Number of Vertices
- On the location of zeros of complex polynomials
- Symmetry in complex networks
Cited in
(2)
This page was built for publication: Relationships between symmetry-based graph measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139463)