For a connected graph G, the Schultz and modified Schultz polynomials are defined as, respectively, where the summations are taken over all unordered pairs of distinct vertices in V(G), is the degree of vertex u, is the distance between u and v and V(G) is the vertex set of G. In this paper, we find Schultz and modified Schultz polynomials of the Cog-special graphs such as a complete graph, a star graph, a wheel graph, a path graph and a cycle graph. The Schultz index, modified Schultz index and average distance of Schultz and modified Schultz of each such Cog-special graphs are also obtained in this paper.
References
[1]
Buckley, F. and Harary, F. (1990) Distance in Graphs. Addison-Wesley, New York.
[2]
Chartrand, G. and Lesniak, L. (1986) Graphs and Digraphs. 2nd Edition, Wadsworth and Brooks/Cole, Pacific Grove.
[3]
Devillers, J. and Balaban, A.T. (1999) Topo-logical Indices and Related Descriptors in QSAR and QSPR. Gordon & Breach, Amsterdam.
[4]
Diestel, R. (2000) Graph Theory, Electronic. Springer-Verlag, New York.
[5]
Diudea, M.V. (2001) QSPR/QSAR Studies by Molecular Descriptors. Nova, Hunting-ton, New York.
[6]
Diudea, M.V., Gutman, I. and Jantschi, L. (2001) Molecular Topology. Nova, Huntington, New York.
[7]
Schultz, H.P. (1989) Topological Organic Chemistry 1. Graph Theory and Topological Indices of Alkanes. The Journal for Chemical Information and Computer scientists, 29, 227-228. https://doi.org/10.1021/ci00063a012
[8]
Klav？ar, S. and Gutman, I. (1997) Wiener Number of Vertex-Weighted Graphs and a Chemical Application. Discrete Applied Mathematics, 80, 73-81. https://doi.org/10.1016/S0166-218X(97)00070-X
[9]
Ahmed, M. and Haitham, N. (2017) Schultz and Modified Schultz Polynomials of Two Operations Gutman’s. International Journal of Enhanced Research in Science, Technology & Engineering, 6, 68-74. https://doi.org/10.11648/j.acm.20170606.14
[10]
Ahmed, M. and Haitham, N. (2017) Schultz and Modified Schultz Polyno-mials of Cog-Complete Bipartite Graphs. Applied and Computational Mathematics, 6, 259-264. https://doi.org/10.11648/j.acm.20170606.14
[11]
Behmaram, A., Yousefi-Azari, H. and Ashrafi, A.R. (2011) Some New Results on Distance-Based Polynomials. MATCH Communications in Mathematical and in Computer Chemistry, 65, 39-50.
