The number of caterpillars

From MaRDI portal
Revision as of 06:28, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2562091

DOI10.1016/0012-365X(73)90067-8zbMath0266.05102OpenAlexW2096481849MaRDI QIDQ2562091

Allen J. Schwenk, Frank Harary

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




Related Items (45)

On multiplicities of eigenvalues of a spectral problem on a prolate treeLog-concavity of some independence polynomials via a partial orderingPentagonal chains and annuli as models for designing nanostructures from cagesA new sum of graphs and caterpillar treesGraphs, partitions and Fibonacci numbersSpanning multi-paths in hypercubesDeriving graphs with a retracting-free bidirectional double tracingLeaf realization problem, caterpillar graphs and prefix normal wordsTHE DEGREE PROFILE AND GINI INDEX OF RANDOM CATERPILLAR TREESPairwise Compatibility Graphs: A SurveyEuclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning CaterpillarsOn a novel eccentricity-based invariant of a graphA study of maximum unit-circle caterpillars---tools for the study of the shape of adsorption patternsCharacterization of co-blockers for simple perfect matchings in a convex geometric graphThe color cost of a caterpillarOn two eccentricity-based topological indices of graphsEmbedding ladders and caterpillars into the hypercubeSchur reduction of trees and extremal entries of the Fiedler vectorThe maximum linear arrangement problem for trees under projectivity and planarityIsolated Rupture in Thorny NetworksResistance distance and spanning 2-forest matrices of linear 2-treesOn chromatic Zagreb indices of certain graphsBlockers for triangulations of a convex polygon and a geometric maker-breaker gameOne node fault tolerance for caterpillars and starlike treesOn \(m\)-closed graphsBlockers for simple Hamiltonian paths in convex geometric graphs of odd orderMAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICESOn convex geometric graphs with no \(k+1\) pairwise disjoint edgesMaximal independent sets in a generalisation of caterpillar graphOn the smallest sets blocking simple perfect matchings in a convex geometric graphThe Gini index of random trees with an application to caterpillarsUnnamed ItemBlockers for simple Hamiltonian paths in convex geometric graphs of even orderOn Mostar and edge Mostar indices of graphsAlpha graphs with different pendent pathsOn domination game stable graphs and domination game edge-critical graphsReciprocal best match graphsClique-perfectness of complements of line graphsOn the burning number of \(p\)-caterpillarsConvex dominating sets in maximal outerplanar graphs2-chains: An interesting family of posetsBurning number of caterpillarsBlock-indifference graphs: characterization, structural and spectral propertiesThe proportion of trees that are linearSum graphs over all the integers




Cites Work




This page was built for publication: The number of caterpillars