Research ArticleOpen AccessGoogle Scholar indexed
Modified Generalized Degree Distance of Some Graph Operations
School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China
- 1 School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China
Advances in Pure Mathematics·Volume 08 (2018)·Pages 548–558·Published 20 June 2018·DOI10.4236/apm.2018.86032
Copy link · social · email
Abstract
The modified generality degree distance, is defined as: , which is a modification of the generality degree distance. In this paper, we give some computing formulas of the modified generality degree distance of some graph operations, such as, composition, join, etc.
KeywordsDegree DistanceModified Generalized Degree DistanceGraph Operations
- Bondy, J. and Murty, U. (1976) Graph Theory with Applications. Elsevier, New York. https://doi.org/10.1007/978-1-349-03521-2
- Gutman, I. and Polansky, O. (1986) Mathematical Concepts in Organic Chemistry. Springer-Verlag, Berlin. https://doi.org/10.1007/978-3-642-70982-1
- Wiener, H. (1947) Structural Determination of Paraffin Boiling Point. Journal of the American Chemical Society, 69, 17-20. https://doi.org/10.1021/ja01193a005
- Dobrynin, A. and Kochetova, A. (1994) Degree Distance of a Graph: A Degree Analogue of the Wiener Index. Journal of Chemical Information and Computer Sciences, 34, 1082-1086. https://doi.org/10.1021/ci00021a008
- Gutman, I. (1994) Selected Properties of the Schultz Molecular Topogical Index. Journal of Chemical Information and Computer Sciences, 34, 1087-1089. https://doi.org/10.1021/ci00021a009
- Gutman, I. and Klavzarc, S. (1997) Wiener Number of Vertex-Weighted Graphs and a Chemical Applications. Discrete Applied Mathematics, 80, 73-81. https://doi.org/10.1016/S0166-218X(97)00070-X
- Gutman, I. (1997) A Property of the Wiener Number and Its Modifications. Indian Journal of Chemistry: Section A, 36, 128-132.
- Gutman, I., Rada, J. and Araujo, O. (2000) The Wiener Index of Starlike Trees and a Related Partial Order. MATCH Communications in Mathematical and in Computer Chemistry, 42, 145-154.
- Hua, H. (2009) Wiener and Schultz Molecular Topological Indices of Graphs with Specified Cut Edges. MATCH Communications in Mathematical and in Computer Chemistry, 16, 643-651.
- Dankelmann, P., Gutman, I., Mukwembi, S. and Swart, H.C. (2009) On the Degree Distance of a Graph. Discrete Applied Mathematics, 157, 2773-2777. https://doi.org/10.1016/j.dam.2009.04.006
- Feng, L., Liu, W., Ili, A. and Yu, G. (2013) Degree Distance of Unicyclic Graphs with Given Matching Number. Graphs and Combinatorics, 5, 449-462. https://doi.org/10.1007/s00373-012-1143-5
- Ilic, A., Stevanovic, D., Feng, L., Yu, G. and Dankelmann, P. (2011) Degree Distance of Unicyclic and bicyclic Graphs. Discrete Applied Mathematics, 159, 779-788. https://doi.org/10.1016/j.dam.2011.01.013
- Tomescu, I. (2008) Properties of Connected Graphs Having Minimum Degree Distance. Discrete Math, 309, 2745-2748. https://doi.org/10.1016/j.disc.2008.06.031
- Tomescu, I. (2010) Ordering Connected Graphs Having Small Degree Distances. Discrete Applied Mathematics, 158, 1714-1717. https://doi.org/10.1016/j.dam.2010.05.023