ON THE SUM OF THE SQUARES OF ALL DISTANCES IN SOME GRAPHS

Authors

  • Xianya Geng Anhui University of Science and Technology - Department of Mathematics and Physics
  • Zhixiang Yin Anhui University of Science and Technology - Department of Mathematics and Physics
  • Xianwen Fang Anhui University of Science and Technology - Department of Mathematics and Physics

Keywords:

chromatic number, clique number

Abstract

Denote the sum of the squares of all distances between all pairs of vertices in G by S(G).  In this article, through the given vertices number of a graph and the chromatic, a lower bound of S(G) is discussed.  By giving the vertices number and the clique number of a graph, the upper and lower bounds of the S(G) are discussed.

Cover of n°38 Italian Journal of Pure and Applied Mathematics

Downloads

Published

2017-07-31

How to Cite

Geng, X., Yin, Z., & Fang, X. (2017). ON THE SUM OF THE SQUARES OF ALL DISTANCES IN SOME GRAPHS. Italian Journal of Pure and Applied Mathematics, 37, 137–144. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/6822

Issue

N°38 - July 2017

Section

Articoli - Forum Editrice

License

Copyright (c) 2017 Xianya Geng, Zhixiang Yin, Xianwen Fang

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

L'opera è pubblicata sotto  Licenza Creative Commons Attribuzione 4.0 Internazionale (CC-BY)

Similar Articles

<< < 1 2 3 4 > >> 

You may also start an advanced similarity search for this article.