Constructive graph labeling using double cosets
From MaRDI portal
Publication:2264765
DOI10.1016/S0012-365X(74)80015-4zbMath0273.05002MaRDI QIDQ2264765
Harold Brown, Larry Hjelmeland, Larry Masinter
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Permutations, words, matrices (05A05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (6)
Permutational isomers on a molecular skeleton with neighbor-excluding ligands ⋮ Construction of discrete structures, especially isomers ⋮ Pruning the search tree in the constructive enumeration of molecular graphs ⋮ An algorithm for the construction of the graphs of organic molecules ⋮ Computer generation of vertex graphs ⋮ Subcomplete generalizations of graph isomorphism
Cites Work
This page was built for publication: Constructive graph labeling using double cosets