Balanced Subeulerian Signed Graphs and Signed Line Graphs

被引:0
作者
Juan LIU [1 ]
Hong YANG [2 ]
Xindong ZHANG [1 ]
Hongjian LAI [3 ]
机构
[1] College of Big Data Statistics, Guizhou University of Finance and Economics
[2] College of Mathematics and System Sciences, Xinjiang University
[3] Department of Mathematics, West Virginia University
关键词
D O I
暂无
中图分类号
O157.5 [图论];
学科分类号
070104 ;
摘要
A signed graph S =(Su, σ) has an underlying graph Suand a function σ : E(Su)-→{+,-}. Let E-(S) denote the set of negative edges of S. Then S is eulerian signed graph(or subeulerian signed graph, or balanced eulerian signed graph, respectively) if Suis eulerian(or subeulerian, or eulerian and |E-(S)| is even, respectively). We say that S is balanced subeulerian signed graph if there exists a balanced eulerian signed graph S′ such that S′ is spanned by S.The signed line graph L(S) of a signed graph S is a signed graph with the vertices of L(S) being the edges of S, where an edge eiej is in L(S) if and only if the edges ei and ej of S have a vertex in common in S such that an edge eiej in L(S) is negative if and only if both edges ei and ej are negative in S. In this paper, two families of signed graphs S and S ′ are identified, which are applied to characterize balanced subeulerian signed graphs and balanced subeulerian signed line graphs. In particular, it is proved that a signed graph S is balanced subeulerian if and only if S?S, and that a signed line graph of signed graph S is balanced subeulerian if and only if S?S ′.
引用
收藏
页码:7 / 17
页数:11
相关论文
共 50 条
[31]   Computing Maximum Structural Balanced Cliques in Signed Graphs [J].
Yao, Kai ;
Chang, Lijun ;
Qin, Lu .
2022 IEEE 38TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2022), 2022, :1004-1016
[32]   Spectral Analysis of k-Balanced Signed Graphs [J].
Wu, Leting ;
Ying, Xiaowei ;
Wu, Xintao ;
Lu, Aidong ;
Zhou, Zhi-Hua .
ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PT II: 15TH PACIFIC-ASIA CONFERENCE, PAKDD 2011, 2011, 6635 :1-12
[33]   Six-flows on almost balanced signed graphs [J].
Wang, Xiao ;
Lu, You ;
Zhang, Cun-Quan ;
Zhang, Shenggui .
JOURNAL OF GRAPH THEORY, 2019, 92 (04) :394-404
[34]   CHARACTERIZATION OF LINE-CONSISTENT SIGNED GRAPHS [J].
Slilaty, Daniel C. ;
Zaslavsky, Thomas .
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2015, 35 (03) :589-594
[35]   ON .-LINE SIGNED GRAPHS L.(S) [J].
Sinha, Deepa ;
Dhama, Ayushi .
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2015, 35 (02) :215-227
[36]   Characterization of Line-Cut Signed Graphs [J].
Jain, Rashmi ;
Acharya, Mukti ;
Kansal, Sangita .
NATIONAL ACADEMY SCIENCE LETTERS-INDIA, 2021, 44 (02) :147-150
[37]   Signed analogue of line graphs and their smallest eigenvalues [J].
Gavrilyuk, Alexander L. ;
Munemasa, Akihiro ;
Sano, Yoshio ;
Taniguchi, Tetsuji .
JOURNAL OF GRAPH THEORY, 2021, 98 (02) :309-325
[38]   Characterization of Line-Cut Signed Graphs [J].
Rashmi Jain ;
Mukti Acharya ;
Sangita Kansal .
National Academy Science Letters, 2021, 44 :147-150
[39]   Signed Circuit Cover of Bridgeless Signed Graphs [J].
Mengmeng Xie ;
Chuixiang Zhou .
Graphs and Combinatorics, 2020, 36 :1423-1443
[40]   Signed degree sequences in signed multipartite graphs [J].
Pirzada, S. ;
Naikoo, T. A. .
HACETTEPE JOURNAL OF MATHEMATICS AND STATISTICS, 2015, 44 (05) :1099-1108