Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (1)

Search Parameters:
Keywords = Steiner Wiener k-index

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
19 pages, 328 KiB  
Article
A Combinatorial Approach to Study the Nordhaus–Guddum-Type Results for Steiner Degree Distance
by Hongfang Liu, Jinxia Liang, Yuhu Liu and Kinkar Chandra Das
Mathematics 2023, 11(3), 738; https://doi.org/10.3390/math11030738 - 1 Feb 2023
Cited by 1 | Viewed by 1665
Abstract
In 1994, Dobrynin and Kochetova introduced the concept of degree distance DD(Γ) of a connected graph Γ. Let dΓ(S) be the Steiner k-distance of SV(Γ). The Steiner [...] Read more.
In 1994, Dobrynin and Kochetova introduced the concept of degree distance DD(Γ) of a connected graph Γ. Let dΓ(S) be the Steiner k-distance of SV(Γ). The Steiner Wiener k-index or k-center Steiner Wiener indexSWk(Γ) of Γ is defined by SWk(Γ)=|S|=kSV(Γ)dΓ(S). The k-center Steiner degree distanceSDDk(Γ) of a connected graph Γ is defined by SDDk(Γ)=|S|=kSV(Γ)vSdegΓ(v)dΓ(S), where degΓ(v) is the degree of the vertex v in Γ. In this paper, we consider the Nordhaus–Gaddum-type results for SWk(Γ) and SDDk(Γ). Upper bounds on SWk(Γ)+SWk(Γ¯) and SWk(Γ)·SWk(Γ¯) are obtained for a connected graph Γ and compared with previous bounds. We present sharp upper and lower bounds of SDDk(Γ)+SDDk(Γ¯) and SDDk(Γ)·SDDk(Γ¯) for a connected graph Γ of order n with maximum degree Δ and minimum degree δ. Some graph classes attaining these bounds are also given. Full article
Show Figures

Figure 1

Back to TopTop