On Ordering and Identifying Undirected Linear Graphs

DOI10.1063/1.1705069zbMath0148.43503OpenAlexW2004882723MaRDI QIDQ5527634

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

Related Items (5)

Loopedia, a database for loop integrals ⋮ Functional closure of Schwinger-Dyson equations in quantum electrodynamics. 1: Generation of connected and one-particle irreducible Feynman diagrams ⋮ Efficient graph automorphism by vertex partitioning ⋮ Numerical representation and identification of graphs ⋮ The Enumeration of Homeomorphically Irreducible Star Graphs

Cites Work

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

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