刻画蕴含C6+P2的可图序列

doi:10.13371/j.cnki.chin.q.j.m.2014.02.012

数学季刊 ›› 2014, Vol. 29 ›› Issue (2): 238-243.doi: 10.13371/j.cnki.chin.q.j.m.2014.02.012

刻画蕴含C₆+P₂的可图序列

Department of Mathematics and Information Science, Zhangzhou Teacher’s College

收稿日期:2012-09-18 出版日期:2014-06-30 发布日期:2021-04-02
作者简介:HU Li-li(1982-), female, native of Zhangzhou, Fujian, a lecturer of Zhangzhou Teacher’s College, M.S.D., engages in graph theory.
基金资助:
Supported by the National Natural Science Foundation of China（11101358）； Supported by the Project of Fujian Education Department（JA11165）； Supported by the Project of Education Department of Fujian Province（JA12209）； Supported by the Project of Zhangzhou Teacher’s College（SJ1104）；

Characterizing C₆ + P₂graphic Sequences

Department of Mathematics and Information Science, Zhangzhou Teacher’s College

Received:2012-09-18 Online:2014-06-30 Published:2021-04-02
About author:HU Li-li(1982-), female, native of Zhangzhou, Fujian, a lecturer of Zhangzhou Teacher’s College, M.S.D., engages in graph theory.
Supported by:
Supported by the National Natural Science Foundation of China（11101358）； Supported by the Project of Fujian Education Department（JA11165）； Supported by the Project of Education Department of Fujian Province（JA12209）； Supported by the Project of Zhangzhou Teacher’s College（SJ1104）；

摘要/Abstract

摘要： For a given graph H, a graphic sequence π =（d₁, d₂, ···, d_n） is said to be potentially H-graphic if π has a realization containing H as a subgraph. In this paper, we characterize the potentially C₆+ P₂-graphic sequences where C₆+ P₂denotes the graph obtained from C₆ by adding two adjacent edges to the three pairwise nonadjacent vertices of C₆. Moreover, we use the characterization to determine the value of σ（C₆+ P₂, n）.

关键词: graph, degree sequence, potentially C₆ + P₂-graphic sequences

Abstract: For a given graph H, a graphic sequence π =（d₁, d₂, ···, d_n） is said to be potentially H-graphic if π has a realization containing H as a subgraph. In this paper, we characterize the potentially C₆+ P₂-graphic sequences where C₆+ P₂denotes the graph obtained from C₆ by adding two adjacent edges to the three pairwise nonadjacent vertices of C₆. Moreover, we use the characterization to determine the value of σ（C₆+ P₂, n）.

Key words: graph, degree sequence, potentially C₆ + P₂-graphic sequences

中图分类号:

O157.5

胡黎莉. 刻画蕴含C₆+P₂的可图序列[J]. 数学季刊, 2014, 29(2): 238-243.

HU Li-li. Characterizing C₆ + P₂graphic Sequences[J]. Chinese Quarterly Journal of Mathematics, 2014, 29(2): 238-243.

[1]	刘树洋, 李峰. 强乘积图的最小强半径[J]. 数学季刊, 2024, 39(1): 68-72.
[2]	攸晓杰, 马海成, 张斌, 李雅兰. 两类四圈图的奇异性[J]. 数学季刊, 2023, 38(4): 349-359.
[3]	王世英, 赵丽娜. 在比较模型下网络是 n-邻 d-可诊断的充分条件[J]. 数学季刊, 2022, 37(4): 343-354.
[4]	林艺舒, 常彩冰, 刘岩. 图族和树族的带宽和割宽的遍历性[J]. 数学季刊, 2022, 37(4): 355-365.
[5]	张庆楠, 惠志昊, 杨雨, 王安. 哈林图的导出匹配可扩性[J]. 数学季刊, 2022, 37(4): 380-385.
[6]	李贝贝, 尚卫苹. 具有特定独立的罗马2-控制数的树[J]. 数学季刊, 2022, 37(4): 386-393.
[7]	张义冉, 王秀梅. 圈强迫的2-连通无爪三正则图的刻画#br# #br# [J]. 数学季刊, 2022, 37(4): 432-440.
[8]	夏伟皓, 石美, 肖明月, 蔡建生, 王纪辉. r-正则有向图的多数染色 [J]. 数学季刊, 2022, 37(2): 142-146.
[9]	白雨杰, 毋述斐. 一类三正则图的全友好指数集[J]. 数学季刊, 2021, 36(3): 221-234.
[10]	阴浩然, 李峰. 有向图强乘积的代数群性质[J]. 数学季刊, 2020, 35(4): 424-430.
[11]	何玉萍, 陈祥恩. mC₉的点可区别全染色的最优算法[J]. 数学季刊, 2019, 34(3): 242-258.
[12]	陈丽娜, 谢炎涛. 关于H-cordial图和semi-H-cordial图的若干结论[J]. 数学季刊, 2019, 34(1): 52-56.
[13]	周后卿. 循环图的距离能量[J]. 数学季刊, 2018, 33(3): 233-239.
[14]	张海良. 关于路与圈的匹配多项式的一个注记[J]. 数学季刊, 2018, 33(2): 140-143.
[15]	任云霞, 王世英. 局部扭立方的1好邻连通度和诊断度[J]. 数学季刊, 2017, 32(4): 371-381.

刻画蕴含C₆+P₂的可图序列

Characterizing C₆ + P₂graphic Sequences

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价