On Ordering and Identifying Undirected Linear Graphs

DOI10.1063/1.1705069MaRDI QIDQ5527634zbMATH OpenOpenAlexFDO

Authors John F. Nagle

Publication date 1966

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1063/1.1705069

zbMATH Keywords

topology

Cites work

• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
• Lattice Constant Systems and Graph Theory
• Lattice Statistics-A Review and an Exact Isotherm for a Plane Lattice Gas
• On hearing the shape of a drum
• Percolation Processes. I. Low-Density Expansion for the Mean Number of Clusters in a Random Mixture
• The Enumeration of Homeomorphically Irreducible Star Graphs

Cited in

(7)

• Efficient graph automorphism by vertex partitioning
• Numerical representation and identification of graphs
• The Enumeration of Homeomorphically Irreducible Star Graphs
• Loopedia, a database for loop integrals
• \texttt{Phi4tools}: compilation of Feynman diagrams for Landau-Ginzburg-Wilson theories
• Functional closure of Schwinger-Dyson equations in quantum electrodynamics. 1: Generation of connected and one-particle irreducible Feynman diagrams
• Multiloop calculations with parametric integration in critical dynamics: the four-loop analytic study of model A of ^4 theory

This page was built for publication: On Ordering and Identifying Undirected Linear Graphs

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