(0, mf-k+1)-图中具有正交(0,f)-因子分解的子图

Operations Research Transactions ›› 2012, Vol. 16 ›› Issue (3): 132-138.

• Original Articles • Previous Articles Next Articles

Subgraph with orthogonal (0,f)-factorization in (0, mf-k+1)-graph

XIAO Lan¹, LIU Yan²

1. School of Science, Nanchang University 2. School of Mathematical Sciences, South China Normal University

Received:2012-04-16 Revised:2012-06-07 Online:2012-09-15 Published:2012-09-18
Contact: XIAO Lan E-mail:xiaolan@amss.ac.cn
Supported by:
National Natural Science Foundation of China (No. 10201019)

Abstract

CLC Number:

05C70

XIAO Lan, LIU Yan. Subgraph with orthogonal (0,f)-factorization in (0, mf-k+1)-graph[J]. Operations Research Transactions, 2012, 16(3): 132-138.

[1]	TIAN Shuangliang, YANG Huan, SUOLANG Wangqing, YANG Qing. Neighbor sum distinguishing edge coloring of the lexicographic product of paths [J]. Operations Research Transactions, 2020, 24(1): 140-146.
[2]	LI Tong, WANG Guanghui, ZHOU Wenling. A survey on rainbow matchings in graphs and hypergraphs [J]. Operations Research Transactions, 2019, 23(3): 77-90.
[3]	TAO Yanliang, HUANG Qiongxiang, CHEN Lin. Contraction graph method for the interval edge-colorings of graphs [J]. Operations Research Transactions, 2019, 23(2): 31-43.
[4]	LIU Yan, LEI Mengxia, HUANG Xiaoxian. Path-transformation graph of maximum matchings [J]. Operations Research Transactions, 2019, 23(2): 104-112.
[5]	LUO Zhaoyang, SUN Lin. The linear aboricity of planar graphs with 6-cycles containing at most one chord [J]. Operations Research Transactions, 2019, 23(2): 113-119.
[6]	PEI Jianfeng, LIN Shangwei. Two sufficient conditions for maximally restricted-edge-connected hypergraphs [J]. Operations Research Transactions, 2019, 23(2): 120-126.
[7]	SUN Qiushi, YANG Xiaoyun, WANG Ligong, LI Xihe, WANG Pengchao. Laplacian spectral characterizations of new unicyclic graphs H(p,tK_1,m) [J]. Operations Research Transactions, 2019, 23(1): 72-80.
[8]	CHEN Yuanyuan, WANG Guoping. On the signless Laplacian spectral radius of tricyclic graphs [J]. Operations Research Transactions, 2019, 23(1): 81-89.
[9]	CHEN Hongyu, TAN Xiang. An upper bound of the linear 2-arboricity of planar graphs with neither 5-cycles nor adjacent 4-cycles [J]. Operations Research Transactions, 2019, 23(1): 104-110.
[10]	YU Guidong, SUN Wei, LU Xingting. The least eignvalue of the graphs whose complements are connected and have pendant vertices [J]. Operations Research Transactions, 2019, 23(1): 90-96.
[11]	REN Jiamin, FENG Wei, ZHAO Lingqi, WANG Shiying, JIRIMUTU. The 1-good-neighbor diagnosability of the Cayley graphs UG_n generated by unicyclic graphs under the PMC model and the MM^* model [J]. Operations Research Transactions, 2019, 23(1): 97-103.
[12]	DING Chao, YU Guidong. Laplacian spectral characterizations of graphs with even cyclic [J]. Operations Research Transactions, 2018, 22(4): 135-140.
[13]	LV Xuezheng, WEI Erling, SONG Hongye. The basis number of join graphs [J]. Operations Research Transactions, 2018, 22(4): 148-152.
[14]	LI Li, SHAN Erfang. Graph games and edge density of graphs [J]. Operations Research Transactions, 2018, 22(4): 99-107.
[15]	QIN Qiannan, SHAO Yanling. Minimum general sum-connectivity index of tricyclic graphs [J]. Operations Research Transactions, 2018, 22(1): 142-150.

Subgraph with orthogonal (0,f)-factorization in (0, mf-k+1)-graph

PDF

Knowledge

Cited

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

Comments