✦ LIBER ✦

On Unique Numbering of Atoms and Unique Codes for Molecular Graphs

✍ Scribed by Randic, Milan

Book ID: 119958881
Publisher: American Chemical Society
Year: 1975
Tongue: English
Weight: 429 KB
Volume: 15
Category: Article
ISSN: 0095-2338
DOI: 10.1021/ci60002a007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unique numbering and cataloging of molec

Unique numbering and cataloging of molecular structures

✍ Hendrickson, James B.; Toczko, A. Glenn 📂 Article 📅 1983 🏛 American Chemical Society 🌐 English ⚖ 881 KB

On the number of unique subgraphs of a g

On the number of unique subgraphs of a graph

✍ A.E Brouwer 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 107 KB

On the number of unique subgraphs of a g

On the number of unique subgraphs of a graph

✍ R.C Entringer; Paul Erdös 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 143 KB

Algorithms for Unique and Unambiguous Co

Algorithms for Unique and Unambiguous Coding and Symmetry Perception of Molecular Structure Diagram. III. Method of Subregion Analysis for Unique Coding and Symmetry Perception

✍ Uchino, Masahiro 📂 Article 📅 1980 🏛 American Chemical Society 🌐 English ⚖ 442 KB

On the join of graphs and chromatic uniq

On the join of graphs and chromatic uniqueness

✍ G. L. Chia 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 519 KB

## Abstract A graph is chromatically unique if it is uniquely determined by its chromatic polynomial. Let __G__ be a chromatically unique graph and let __K__~__m__~ denote the complete graph on __m__ vertices. This paper is mainly concerned with the chromaticity of __K__~__m__~ + __G__ where + deno

The number of shortest cycles and the ch

The number of shortest cycles and the chromatic uniqueness of a graph

✍ C. P. Teo; K. M. Koh 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 403 KB 👁 2 views

## Abstract For a graph __G__, let __g__(__G__) and σ~g~(__G__) denote, respectively, the girth of __G__ and the number of cycles of length __g__(__G__) in __G__. In this paper, we first obtain an upper bound for σ~g~(__G__) and determine the structure of a 2‐connected graph __G__ when σ~g~(__G__)