Research on Some Conclusions of the Distance Spectrum of a Graph

DOI

10.2991/etmhs-16.2016.54How to use a DOI?

Keywords

Distance spectrum; Spectral radius; Some graph

Abstract

This paper studies some graph distance spectrum, first introduces the basic concepts that used in this article, and related terms and the main results obtained mark in this paper. At the same time the paper depicts the matching number is , order number is n that has minimum distance spectral radius of graph in all connected graph. The article finally calculated the distance spectrum of G K2 and .

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - ZhiHui Ma
PY  - 2016/01
DA  - 2016/01
TI  - Research on Some Conclusions of the Distance Spectrum of a Graph
BT  - Proceedings of the 2016 2nd International Conference on Education Technology, Management and Humanities Science
PB  - Atlantis Press
SP  - 239
EP  - 242
SN  - 2352-5398
UR  - https://doi.org/10.2991/etmhs-16.2016.54
DO  - 10.2991/etmhs-16.2016.54
ID  - Ma2016/01
ER  -