The number of caterpillars

DOI10.1016/0012-365X(73)90067-8MaRDI QIDQ2562091zbMATH OpenOpenAlexFDO

Authors Frank Harary, Allen J. Schwenk

Publication date 1973

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(73)90067-8

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Cites work

• scientific article; zbMATH DE number 3412664 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• scientific article; zbMATH DE number 3060538 (Why is no real title available?)
• Parallel concepts in graph theory
• Trees with Hamiltonian square

Cited in

(46)

• Resistance distance and spanning 2-forest matrices of linear 2-trees
• MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES
• Block-indifference graphs: characterization, structural and spectral properties
• On a novel eccentricity-based invariant of a graph
• On domination game stable graphs and domination game edge-critical graphs
• On \(m\)-closed graphs
• On the smallest sets blocking simple perfect matchings in a convex geometric graph
• Deriving graphs with a retracting-free bidirectional double tracing
• Pentagonal chains and annuli as models for designing nanostructures from cages
• Log-concavity of some independence polynomials via a partial ordering
• Blockers for simple Hamiltonian paths in convex geometric graphs of even order
• Pairwise compatibility graphs: a survey
• Leaf realization problem, caterpillar graphs and prefix normal words
• Sum graphs over all the integers
• Isolated Rupture in Thorny Networks
• The color cost of a caterpillar
• The Gini index of random trees with an application to caterpillars
• On two eccentricity-based topological indices of graphs
• Schur reduction of trees and extremal entries of the Fiedler vector
• On Mostar and edge Mostar indices of graphs
• Spanning multi-paths in hypercubes
• How to count \(k\)-paths
• THE DEGREE PROFILE AND GINI INDEX OF RANDOM CATERPILLAR TREES
• The maximum linear arrangement problem for trees under projectivity and planarity
• Reciprocal best match graphs
• Extreme values of the Fiedler vector on trees
• Blockers for simple Hamiltonian paths in convex geometric graphs of odd order
• 2-chains: An interesting family of posets
• Burning number of caterpillars
• A study of maximum unit-circle caterpillars---tools for the study of the shape of adsorption patterns
• Embedding ladders and caterpillars into the hypercube
• The proportion of trees that are linear
• One node fault tolerance for caterpillars and starlike trees
• On convex geometric graphs with no \(k+1\) pairwise disjoint edges
• Alpha graphs with different pendent paths
• On multiplicities of eigenvalues of a spectral problem on a prolate tree
• Characterization of co-blockers for simple perfect matchings in a convex geometric graph
• Euclidean networks with a backbone and a limit theorem for minimum spanning caterpillars
• Maximal independent sets in a generalisation of caterpillar graph
• Clique-perfectness of complements of line graphs
• Convex dominating sets in maximal outerplanar graphs
• On chromatic Zagreb indices of certain graphs
• A new sum of graphs and caterpillar trees
• Blockers for triangulations of a convex polygon and a geometric maker-breaker game
• On the burning number of \(p\)-caterpillars
• Graphs, partitions and Fibonacci numbers

This page was built for publication: The number of caterpillars

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