EconPapers    
Economics at your fingertips  
 

The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees

Wanping Zhang, Jixiang Meng () and Baoyindureng Wu
Additional contact information
Wanping Zhang: Xinjiang University
Jixiang Meng: Xinjiang University
Baoyindureng Wu: Xinjiang University

Journal of Combinatorial Optimization, 2022, vol. 44, issue 2, No 15, 1199-1220

Abstract: Abstract For $$k \in {\mathbb {N}},$$ k ∈ N , Ali et al. (Discrete Appl Math 160:1845-1850, 2012) introduce the Steiner k-Wiener index $$SW_{k}(G)=\sum _{S\in V(G)} d(S),$$ S W k ( G ) = ∑ S ∈ V ( G ) d ( S ) , where d(S) is the minimum size of a connected subgraph of G containing the vertices of S. The average Steiner k-distance $$\mu _{k}(G)$$ μ k ( G ) of G is defined as $$\genfrac(){0.0pt}1{n}{k}^{-1} SW_{k}(G)$$ n k - 1 S W k ( G ) . In this paper, we give some upper bounds on $$SW_{k}(G)$$ S W k ( G ) and $$\mu _{k}(G)$$ μ k ( G ) in terms of minimum degree, maximum degree and girth in a triangle-free or a $$C_{4}$$ C 4 -free graph.

Keywords: Steiner k-Wiener index; Average Steiner k-distance; Minimum degree; Maximum degree; Girth; Packing (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00887-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:44:y:2022:i:2:d:10.1007_s10878-022-00887-6

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

DOI: 10.1007/s10878-022-00887-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 ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:44:y:2022:i:2:d:10.1007_s10878-022-00887-6