Steiner Distance in Join, Corona, Cluster, and Threshold Graphs

被引：4

作者：

Wang, Zhao ^{[1
]}

Mao, Yaping ^{[2
]}

Melekian, Christopher ^{[3
]}

Cheng, Eddie ^{[3
]}

机构：

[1] Beijing Normal Univ, Sch Math Sci, Beijing 100875, Peoples R China

[2] Qinghai Normal Univ, Dept Math, Xining 810008, Qinghai, Peoples R China

[3] Oakland Univ, Dept Math & Stat, Oakland, MI 48309 USA

来源：

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | 2019年 / 35卷 / 04期

基金：

美国国家科学基金会;

关键词：

wireless sensor networks; localization; mobile beacon; mobile anchor; RSSI; DIAMETER;

D O I：

10.6688/JISE.201907_35(4).0001

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

For a connected graph G and a subset S of its vertices, the Steiner tree problem consists of finding a minimum-size connected subgraph containing S. The Steiner distance of S is the size of a Steiner tree for S, and the Steiner k-diameter of G is the maximum value of the Steiner distance over all vertex subsets S of cardinality k. Calculation of Steiner trees and Steiner distance is known to be NP-hard in general, so applications may benefit from using graphs where the Steiner distance and structure of Steiner trees are known. In this paper, we investigate the Steiner distance and Steiner k-diameter of the join, corona, and cluster of connected graphs, as well as threshold graphs.

引用

页码：721 / 735

页数：15

共 50 条

[21] On the power domination number of corona product and join graphs
Yuliana, I.
Dafik
Agustin, I.H.
Wardani, D.A.R.
Journal of Physics: Conference Series, 2019, 1211 (01):
[22] Global Defensive Alliances in the Join, Corona and Composition of Graphs
Eballe, Rolito G.
Aldema, Rodelito M.
Paluga, Esamel M.
Rulete, Ricky F.
Jamil, Ferdinand P.
ARS COMBINATORIA, 2012, 107 : 225 - 245
[23] THE STRONG CONNECTED METRIC DIMENSION IN THE JOIN AND CORONA OF GRAPHS
Acal, Penelyn L.
Rara, Helen M.
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2019, 21 (01): : 91 - 101
[24] On 2-Resolving Sets in the Join and Corona of Graphs
Cabaro, Jean
Rara, Helen
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2021, 14 (03): : 773 - 782
[25] Cost Effective Domination in the Join, Corona and Composition of Graphs
Jamil, Ferdinand P.
Nuenay-Maglanque, Hearty M.
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2019, 12 (03): : 978 - 998
[26] ON 2-MOVABLE DOMINATION IN THE JOIN AND CORONA OF GRAPHS
Pedrano, Ariel C.
Paluga, Rolando N.
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2025, 42 (02): : 89 - 96
[27] Monophonic and Geodetic Dominations in the Join, Corona and Composition of Graphs
Tacbobo, Teresa L.
Jamil, Ferdinand P.
Canoy, Sergio R., Jr.
ARS COMBINATORIA, 2013, 112 : 13 - 31
[28] On the power domination number of corona product and join graphs
Yuliana, I.
Dafik
Agustin, I. H.
Wardani, D. A. R.
2ND INTERNATIONAL CONFERENCE OF COMBINATORICS, GRAPH THEORY, AND NETWORK TOPOLOGY, 2019,
[29] On the average Steiner distance of graphs with prescribed properties
Dept. of Math. and Appl. Mathematics, University of Natal, Private Bag X10 Dalbridge, Durban, 4014, South Africa
不详
Discrete Appl Math, 1-3 (91-103):
[30] Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
Oellermann, Ortrud R.
Puertas, Maria Luz
DISCRETE MATHEMATICS, 2007, 307 (01) : 88 - 96

← 1 2 3 4 5 →