Schultz polynomials of composite graphs

11Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

For a connected graph G, the Schultz and modified Schultz polynomials, introduced by I. Gutman: Some relations between distance-based polynomials of trees. Bulletin, Classe des Sciences Math́ematiques et Naturelles, Sciences math́ematiques, Vol. CXXXI, 30 (2005) 1-7, are defined as H1(G,x) = 1/2∑{(δu + δv)xd(u,v,|G) | u,v,∈ V(G), u ≠ v} and H2(G,x) = 1/2∑{(δuδv)xd(u,v,|G) | u,v,∈ V(G), u ≠ v}, respectively, where δu is the degree of vertex u, d(u, v|G) is the distance between u and v and V(G) is the vertex set of G. In this paper we find identities for the Schultz and modified Schultz polynomials of the sum, join and composition of graphs. As an application of our results we find the Schultz polynomial of C4 nanotubes.

Cite

CITATION STYLE

APA

Eliasi, M., & Taeri, B. (2008). Schultz polynomials of composite graphs. Applicable Analysis and Discrete Mathematics, 2(2), 285–296. https://doi.org/10.2298/AADM0802285E

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free