Enumeration of subtrees of planar two-tree networks

DOI10.1016/J.AMC.2022.127404MaRDI QIDQ2168574zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 26 August 2022

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2022.127404

zbMATH Keywords

edge orientationplanar two-connected networksplanar two-tree networkssubtreevirtual edge

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) General topics of discrete mathematics in relation to computer science (68R01) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Enumeration of spanning trees of 2-separable networks
• Counting and enumerating tree-child networks and their subclasses
• Enumeration of subtrees of trees
• Enumeration of spanning trees in planar unclustered networks
• Enumeration of constrained subtrees of trees
• scientific article; zbMATH DE number 3957134
• Enumeration of spanning trees of certain graphs
• Enumeration of solid 2-trees according to edge number and edge degree distribution
• Enumeration of BC-subtrees of trees
• Counting two-graphs related to trees

Cites work

• A classification of plane and planar 2-trees
• Atom-bond connectivity index of trees
• Counting spanning trees of a type of generalized Farey graphs
• Enumeration of BC-subtrees of trees
• Enumeration of spanning trees in planar unclustered networks
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• Enumeration of subtrees of trees
• Extreme Wiener indices of trees with given number of vertices of maximum degree
• Farey graphs as models for complex networks
• Farey Series and Maximal Outerplanar Graphs
• Invulnerability of planar two-tree networks
• Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees
• New method for counting the number of spanning trees in a two-tree network
• On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
• On subtrees of trees
• Resistance distance and spanning 2-forest matrices of linear 2-trees
• Resistance distance in straight linear 2-trees
• Subtrees of graphs
• The expected subtree number index in random polyphenylene and spiro chains
• The expected values of Wiener indices in random polycyclic chains
• The harmonic index of two-trees and quasi-tree graphs
• The number of subtrees in graphs with given number of cut edges
• The Wiener index of signed graphs
• Topological indices based on 2- or 3-eccentricity to predict anti-HIV activity
• Trees with large numbers of subtrees

Cited in

(7)

• Enumeration of spanning trees of 2-separable networks
• Trees with large numbers of subtrees
• Computing the number and average size of connected sets in planar 3-trees
• Exact counting of subtrees with diameter no more than d in trees: a generating function approach
• The average order of a connected vertex set in generalized ladder graphs
• Enumerating graphlets with amortized time complexity independent of graph size
• A sharp upper bound for the number of connected sets in any grid graph

This page was built for publication: Enumeration of subtrees of planar two-tree networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168574)