Further properties on the degree distance of graphs

Hongzhuan Wang and Liying Kang ()
Additional contact information
Hongzhuan Wang: Shanghai University
Liying Kang: Shanghai University

Journal of Combinatorial Optimization, 2016, vol. 31, issue 1, No 28, 427-446

Abstract: Abstract In this paper, we study the degree distance of a connected graph $$G$$ G , defined as $$D^{'} (G)=\sum _{u\in V(G)} d_{G} (u)D_{G} (u)$$ D ′ ( G ) = ∑ u ∈ V ( G ) d G ( u ) D G ( u ) , where $$D_{G} (u)$$ D G ( u ) is the sum of distances between the vertex $$u$$ u and all other vertices in $$G$$ G and $$d_{G} (u)$$ d G ( u ) denotes the degree of vertex $$u$$ u in $$G$$ G . Our main purpose is to investigate some properties of degree distance. We first investigate degree distance of tensor product $$G\times K_{m_0,m_1,\cdots ,m_{r-1}}$$ G × K m 0 , m 1 , ⋯ , m r - 1 , where $$K_{m_0,m_1,\cdots ,m_{r-1}}$$ K m 0 , m 1 , ⋯ , m r - 1 is the complete multipartite graph with partite sets of sizes $$m_0,m_1,\cdots ,m_{r-1}$$ m 0 , m 1 , ⋯ , m r - 1 , and we present explicit formulas for degree distance of the product graph. In addition, we give some Nordhaus–Gaddum type bounds for degree distance. Finally, we compare the degree distance and eccentric distance sum for some graph families.

Keywords: Degree distance; Eccentric distance sum; Tensor product; 05C90; 05C12; 05C35 (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9757-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:1:d:10.1007_s10878-014-9757-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9757-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().