On the Number of All Substructures Containing at Most Four Edges

DOI10.46793/match.89-2.327GzbMath1505.92281OpenAlexW4291782630MaRDI QIDQ5050770

No author found.

Publication date: 17 November 2022

Published in: MATCH Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.46793/match.89-2.327g

Mathematics Subject Classification ID

Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Cites Work

• On extremal Zagreb indices of trees with given domination number
• Signless Laplacians of finite graphs
• On matching coefficients
• A certain polynomial of a graph and graphs with an extremal number of trees
• The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
• On bipartite graphs having minimum fourth adjacency coefficient
• Analyzing lattice networks through substructures
• On the Complexity of General Graph Factor Problems
• A proof of Boesch's conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item