Embedding of signed regular graphs

被引：1

作者：

Sinha, Deepa ^{[1
]}

Rao, Anita Kumari ^{[1
]}

机构：

[1] South Asian Univ, Dept Math, New Delhi 110021, India

来源：

NOTES ON NUMBER THEORY AND DISCRETE MATHEMATICS | 2018年 / 24卷 / 03期

关键词：

Signed graph; Signed-regular graph; Embedding;

D O I：

10.7546/nntdm.2018.24.3.131-141

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A signed graph is a graph whose edges carry the weight '+' or '-'. A signed graph S is called signed-regular if d(-)(v) is same for all v is an element of V and d(+)(v) is same for all v is an element of V. The problems of embedding (i, j)-signed-regular graphs in (i, j + l)-signed-regular graphs is one of the fascinating problems from application point of view, which is dealt in this paper with insertion of least number of vertices in S.

引用

页码：131 / 141

页数：11

共 24 条

[1]

Acharya B. D., 2012, COMMUNICATION

[2]

Acharya B.D., 1982, DEFENCE SCI J, V32, P231, DOI DOI 10.14429/dsj.32.6301

[3]

Acharya M, 2013, ARS COMBINATORIA, V111, P421

[4]

Archdeacon D., 1990, TOPICS COMBINATORICS, P59

[5]

Behzad M., 1971, INTRO THEORY GRAPHS

[6] MAXIMAL MATCHINGS IN GRAPHS WITH GIVEN MINIMAL AND MAXIMAL DEGREES [J].

BOLLOBAS, B ;

ELDRIDGE, SE .

MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1976, 79 (MAR) :221-234

[7]

GARDINER A, 1983, J LOND MATH SOC, V28, P393

[8] Efficient embeddings of ternary trees into hypercubes [J].

Gupta, AK ;

Nelson, D ;

Wang, H .

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2003, 63 (06) :619-629

[9]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[10] Obstructions for 2-Mobius band embedding extension problem [J].

Juvan, M ;

Mohar, B .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 1997, 10 (01) :57-72

← 1 2 3 →