scientific article
From MaRDI portal
Publication:3998309
zbMath0746.05063MaRDI QIDQ3998309
No author found.
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
enumerationGraph theorychemical graph theoryChemical graph theorychemical informationmathematization of chemistry
Applications of graph theory (05C90) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Proceedings, conferences, collections, etc. pertaining to biology (92-06)
Related Items (37)
ZAGREB ECCENTRICITY INDICES OF VICSEK NETWORKS ⋮ Type-itemized enumeration of quadruplets of \textit{RS}-stereoisomers. II: Cycle indices with chirality fittingness modulated by type-V quadruplets ⋮ ECCENTRIC STEINER DISTANCE SUM OF VICSEK NETWORKS ⋮ On Wiener and terminal Wiener index of graphs ⋮ Wiener Index of Families of Unicyclic Graphs Obtained From a Tree ⋮ On the Wiener Index of Two Families Generated by Joining a Graph to a Tree ⋮ On eccentric connectivity index of eccentric graph of regular dendrimer ⋮ Average geodesic distance of skeleton networks of Sierpinski tetrahedron ⋮ Unnamed Item ⋮ An analysis of the redundancy of graph invariants used in chemoinformatics ⋮ Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes ⋮ On the zeros of the partial Hosoya polynomial of graphs ⋮ A coarse graining method for the dimension reduction of the state space of biomolecules ⋮ On computing some degree based topological indices for backbone DNA networks ⋮ Unnamed Item ⋮ Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial ⋮ Some results on the Wiener index related to the Šoltés problem of graphs ⋮ Graph measures with high discrimination power revisited: a random polynomial approach ⋮ Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach ⋮ Unnamed Item ⋮ Analytic results on the polymerisation random graph model ⋮ Unnamed Item ⋮ Universal construction mechanism for networks from one-dimensional symbol sequences ⋮ Complexity of splits reconstruction for low-degree trees ⋮ Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix ⋮ Extremality of degree-based graph entropies ⋮ Agnostic science. Towards a philosophy of data analysis ⋮ A fast discovery algorithm for large common connected induced subgraphs ⋮ ASYMPTOTIC FORMULA OF ECCENTRIC DISTANCE SUM FOR VICSEK NETWORK ⋮ Fourier decompositions of graphs with symmetries and equitable partitions ⋮ Highly unique network descriptors based on the roots of the permanental polynomial ⋮ Unnamed Item ⋮ Complexity of Splits Reconstruction for Low-Degree Trees ⋮ Unnamed Item ⋮ Wiener index of subdivisions of a tree ⋮ Boundary uniqueness of fusenes ⋮ ECCENTRIC DISTANCE SUM OF SUBSTITUTION TREE NETWORKS
This page was built for publication:
