DISTANCE MAJORIZATION SETS IN GRAPHS

被引：0

|

作者：

Sundareswaran, R. ^{[1
]}

Swaminathan, V. ^{[2
]}

机构：

[1] SSN Coll Engn, Dept Math, Madras, Tamil Nadu, India

[2] SN Coll, Dept Math, Madurai, Tamil Nadu, India

来源：

TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS | 2015年 / 5卷 / 01期

关键词：

Distance; Diameter; Degree;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

收藏

页码：118 / 123

页数：6

相关论文

共 50 条

[1] Distance spectral radius of complete multipartite graphs and majorization
Oboudi, Mohammad Reza
LINEAR ALGEBRA AND ITS APPLICATIONS, 2019, 583 : 134 - 145
[2] Distance Similar Sets in Graphs
Arumugam, S.
Kumar, R. Anantha
UTILITAS MATHEMATICA, 2017, 102 : 265 - 281
[3] Coloring of distance graphs with intervals as distance sets
Lam, PCB
Lin, WS
EUROPEAN JOURNAL OF COMBINATORICS, 2005, 26 (08) : 1216 - 1229
[4] Distance graphs with missing multiples in the distance sets
Liu, DDF
Zhu, XD
JOURNAL OF GRAPH THEORY, 1999, 30 (04) : 245 - 259
[5] MAJORIZATION OF FEYNMAN GRAPHS
CHOW, Y
JOURNAL OF MATHEMATICAL PHYSICS, 1966, 7 (07) : 1158 - &
[6] On representations of graphs as two-distance sets
Alfakih, A. Y.
DISCRETE MATHEMATICS, 2020, 343 (0I)
[7] Graphs and spherical two-distance sets
Musin, Oleg R.
EUROPEAN JOURNAL OF COMBINATORICS, 2019, 80 : 311 - 325
[8] Large sets of long distance equienergetic graphs
Stevanovic, Dragan
ARS MATHEMATICA CONTEMPORANEA, 2009, 2 (01) : 35 - 40
[9] Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
LIESP, Université Claude Bernard LyonI, 843, Bd. Du 11 Novembre 1918, 69622 Villeurbanne Cedex, France
不详
Discrete Math. Theor. Comput. Sci., 2008, 1 (57-70):
[10] Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
Kheddouci, Hamamache
Togni, Olivier
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2008, 10 (01): : 57 - 70

← 1 2 3 4 5 →