Two metrics in a graph theory modeling of organic chemistry
From MaRDI portal
Publication:1183341
DOI10.1016/0166-218X(92)90292-IzbMath0743.05053MaRDI QIDQ1183341
Vladimir Kvasnička, Vladimir Baláž, Jiři Pospíchal
Publication date: 28 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graph theory (05C99)
Related Items
Approximating degree sequences with regular graphic sequences (extended abstract), Graphic sequences, distances and \(k\)-degree anonymity
Cites Work
- Edge rotations and distance between graphs
- A metric for graphs
- Greatest common subgraphs of graphs
- Backtrack search algorithms and the maximal common subgraph problem
- On a certain distance between isomorphism classes of graphs
- Graph reconstruction—a survey
- Dual approach to edge distance between graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item