Modified Wiener indices of thorn trees

Bo Zhou

Displaying similar documents to “Modified Wiener indices of thorn trees”

On the coefficients of the Laplacian characteristic polynomial of trees.

Gutman, I., Pavlović, Ljiljana (2003)

Bulletin. Classe des Sciences Mathématiques et Naturelles. Sciences Mathématiques

Similarity:

Helly Property for Subtrees

Jessica Enright, Piotr Rudnicki (2008)

Formalized Mathematics

Similarity:

We prove, following [5, p. 92], that any family of subtrees of a finite tree satisfies the Helly property.MML identifier: HELLY, version: 7.8.09 4.97.1001

Complexes of Directed Trees of Complete Multipartite Graphs

Duško Jojić (2012)

Publications de l'Institut Mathématique

Similarity:

Some relations between distance-based polynomials of trees

I. Gutman (2005)

Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques

Similarity:

The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree

Rosário Fernandes (2015)

Special Matrices

Similarity:

The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree, M1, was understood fully (froma combinatorial perspective) by C.R. Johnson, A. Leal-Duarte (Linear Algebra and Multilinear Algebra 46 (1999) 139-144). Among the possible multiplicity lists for the eigenvalues of Hermitian matrices whose graph is a tree, we focus upon M2, the maximum value of the sum of the two largest multiplicities when the largest multiplicity is M1. Upper and lower bounds are given for M2....

Laplacian matrix and distance in trees

Damir Vukičević, Ivan Gutman (2004)

Kragujevac Journal of Mathematics

Similarity:

Automorphisms of the Planar Tree Power Series Algebra and the Non-Associative Logarithm

Gerritzen, L. (2004)

Serdica Mathematical Journal

Similarity:

2000 Mathematics Subject Classification: 17A50, 05C05. In this note we present the formula for the coefficients of the substitution series f(g(x)) of planar tree power series g(x) into f(x).

Generalized connected domination in graphs.

Kouider, Mekkia, Vestergaard, Preben Dahl (2006)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

On the formal inverse of polynomial endomorphisms

Piotr Ossowski (1998)

Colloquium Mathematicae

Similarity:

Efficient offline algorithmic techniques for several packet routing problems in distributed systems.

Andreica, Mugurel Ionuţ, Ţăpuş, Nicolae (2009)

Acta Universitatis Apulensis. Mathematics - Informatics

Similarity: