Graph theoretic models

DOI10.1016/0304-3975(80)90041-9zbMath0452.05053OpenAlexW1969765841MaRDI QIDQ1148340

Frank Harary

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/23224

zbMATH Keywords

sparse matricesreconstruction conjecturegraph isomorphism

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph theory (05C99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spektren endlicher Grafen
• A graph theoretic approach to matrix inversion by partitioning
• The smallest graphs with certain adjacency properties
• A simple algorithm to detect balance in signed graphs
• Parallel concepts in graph theory
• A simpler counterexample to the reconstruction conjecture for denumerable graphs
• Identification of the Liaison Persons of an Organization Using the Structure Matrix
• Further annotated bibliography on the isomorphism disease
• Properties of almost all graphs and complexes
• A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues
• Probabilities on finite models
• The graph isomorphism disease

This page was built for publication: Graph theoretic models