Cataloguing general graphs by point and line spectra

DOI10.1016/S0010-4655(98)00115-5zbMath0994.05076MaRDI QIDQ1125186

Itshak Borosh, Andrea da Conturbia, Stephen A. Fulling

Publication date: 30 November 1999

Published in: Computer Physics Communications (Search for Journal in Brave)

zbMATH Keywords

symbolic computationgenerating functionpoint spectrumgeneral graphsline spectrumnumber of labeled graphs

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On some putative graph-theoretic counterexamples to the principle of the identity of indiscernibles

Uses Software

• Mathematica
• SCHUR

Cites Work

• The spectral geometry of a Riemannian manifold
• Moyal quantum mechanics: The semiclassical Heisenberg dynamics
• The representation space of the nuclear symplectic Sp(6,R) shell model
• The graph isomorphism disease
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Efficient Algorithms for Listing Combinatorial Structures
• Normal forms for tensor polynomials. I. The Riemann tensor
• A phase-space technique for the perturbation expansion of Schrödinger propagators
• Enumeration of Graphs with Given Partition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cataloguing general graphs by point and line spectra