Molecular graphs able to model covalent multiple bonds are called plerographs. For such graphs with single, double and triple edges, we define here the compact degree sequence (n(1), n(2), n(3), n(4)), where n(i), i = 1, 2, 3, 4 denote the number of vertices of degree i. We have found the necessary and sufficient conditions (n(1), n(2), n(3), n(4)) for the existence of graph G such that G has nj, n2, n3 and n4 vertices of degrees 1, 2, 3 and 4, and have formulated the findings into three theorems
The identification of main-group molecules having atoms with closed valence p shells, i.e., having a...
AbstractBose and Laskar introduced the tetrahedral graph G, whose points may be identified with the ...
AbstractExhaustive and nonredundant constructive enumeration of molecular graphs (vertex colored mul...
Molecular graphs able to model covalent multiple bonds are called plerographs. For such graphs with ...
Molecular graphs able to model covalent multiple bonds are called plerographs. For such graphs, with...
Molecular graphs able to model covalent multiple bonds are called plerographs. For such graphs, with...
Molecular graphs able to model covalent multiple bonds are called plerographs. For such graphs with ...
In this paper, necessary and sufficient conditions are given for the existence of molecular graph(s)...
In this paper, necessary and sufficient conditions are given for the existence of molecular graph(s)...
Valence connectivities in hydrogen suppressed graphs are characterized by 10-tuples of quantities m(...
Valence connectivities in hydrogen suppressed graphs are characterized by 10-tuples of quantities mi...
While reviewing molecules corresponding to reciprocal graphs (graphs with all reciprocal eigenvalue ...
Set theory is used to forecast the existence of all possible octet-rule cyclic and acyclic molecules...
The identification of main-group molecules having atoms with closed valence p shells, i.e., having a...
Watkins and Mesner characterized edge-triples of a graph which are not in any circuit, and Chakravar...
The identification of main-group molecules having atoms with closed valence p shells, i.e., having a...
AbstractBose and Laskar introduced the tetrahedral graph G, whose points may be identified with the ...
AbstractExhaustive and nonredundant constructive enumeration of molecular graphs (vertex colored mul...
Molecular graphs able to model covalent multiple bonds are called plerographs. For such graphs with ...
Molecular graphs able to model covalent multiple bonds are called plerographs. For such graphs, with...
Molecular graphs able to model covalent multiple bonds are called plerographs. For such graphs, with...
Molecular graphs able to model covalent multiple bonds are called plerographs. For such graphs with ...
In this paper, necessary and sufficient conditions are given for the existence of molecular graph(s)...
In this paper, necessary and sufficient conditions are given for the existence of molecular graph(s)...
Valence connectivities in hydrogen suppressed graphs are characterized by 10-tuples of quantities m(...
Valence connectivities in hydrogen suppressed graphs are characterized by 10-tuples of quantities mi...
While reviewing molecules corresponding to reciprocal graphs (graphs with all reciprocal eigenvalue ...
Set theory is used to forecast the existence of all possible octet-rule cyclic and acyclic molecules...
The identification of main-group molecules having atoms with closed valence p shells, i.e., having a...
Watkins and Mesner characterized edge-triples of a graph which are not in any circuit, and Chakravar...
The identification of main-group molecules having atoms with closed valence p shells, i.e., having a...
AbstractBose and Laskar introduced the tetrahedral graph G, whose points may be identified with the ...
AbstractExhaustive and nonredundant constructive enumeration of molecular graphs (vertex colored mul...