Walks and paths in trees
From MaRDI portal
Publication:2888879
DOI10.1002/jgt.20600zbMath1242.05055arXiv1002.2768MaRDI QIDQ2888879
Mykhaylo Tyomkyn, Béla Bollobás
Publication date: 4 June 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.2768
Related Items
Homomorphisms of Trees into a Path, Some extremal properties of the multiplicatively weighted Harary index of a graph, Graph homomorphisms between trees, On the extremal total reciprocal edge-eccentricity of trees, Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications, Edge-grafting transformations on the average eccentricity of graphs and their applications, On the generalized Wiener polarity index of trees with a given diameter, On a poset of trees revisited, Ordering starlike trees by the totality of their spectral moments, On the (reverse) cover cost of trees with some given parameters, On majorization of closed walk vectors of trees with given degree sequences, On the reformulated reciprocal sum-degree distance of graph transformations, On extremal bipartite unicyclic graphs, On extremal bipartite bicyclic graphs, A Turán-type problem on distances in graphs, On a Poset of Trees II
Cites Work
- On a poset of trees
- On the number of certain subgraphs contained in graphs with a given number of edges
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- Comparison of graphs by their number of spanning trees
- Paths of length four
- Estimating the Estrada index
- Rearrangements of \((0,-1)\) matrices
- On graphs with randomly deleted edges
- Graphs with maximal number of adjacent pairs of edges
- Unnamed Item
- Unnamed Item
