JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2022, Vol. 57 ›› Issue (5): 92-96.doi: 10.6040/j.issn.1671-9352.0.2020.398

Previous Articles    

Connectivity and Hamiltonian properties of second order circuit graphs of a class of uniform matroid

DENG Zi-Jian1, LIU Bin1, HUO Bo-feng1,2*   

  1. 1. College of Mathematics and Statistics, Qinghai Normal University, Xining 810008, Qinghai, China;
    2. Internet of Things Key Laboratory, Xining 810008, Qinghai, China
  • Published:2022-05-27

PDF (PC)

452

Abstract: The connectivity and Hamiltonian properties of the second order circuit graph of the uniform matroid U2,n have been investigated. The second order circuit graph of U2,n is 3(n-3)-regular graph and the connectivity and edge-connectivity of its are equal to the minimum degree. Furthermore, Hamiltonian properties of the second order circuit graph of U2,n is introduced and it is Hamiltonian connected.

Key words: uniform matroid, second order circuit graph, connectivity, minimum degree, Hamiltonian connected

CLC Number: 

  • O157.5
[1] WHITNEY H. On the abstract properties of linear dependence[J]. Amer J Math, 1935, 57(3):509-533.
[2] 李萍. 拟阵圈图的一些性质[D]. 济南: 山东大学, 2010. LI Ping. Some properties of circuit graphs of matroids[D]. Jinan: Shandong University, 2010.
[3] FAN H, LIU G Z. Properties of Hamilton cycles of circuit graphs of matroids[J]. Frontiers of Mathematics in China, 2013, 8(4):801-809.
[4] LI P, LIU G Z. Hamilton cycles in circuit graphs of matroids[J]. Computers & Mathematics With Applications, 2008, 55(4):654-659.
[5] LIU G Z, LI P. Paths in circuit graphs of matroids[J]. Theoretical Computer Science, 2008, 396(1/2/3):258-263.
[6] LI P, LIU G Z. The connectivity and minimum degree of circuit graphs of matroids[J]. Acta Mathematica Sinica, English Series, 2010, 26(2):353-360.
[7] LI P, LIU G Z. Cycles in circuit graphs of matroids[J]. Graphs and Combinatorics, 2007, 23(4):425-431.
[8] 赖虹建. 拟阵论[M]. 北京: 高等教育出版社, 2002. LAI Hongjian. Matroid Theory[M]. Beijing: Higher Education Press, 2002.
[1] WU Liu-san, CHEN Li. Research on the network heterogeneity based on Gini coefficient [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2019, 54(4): 100-104.
[2] YE Fu-mei. Existence results of a resonance problem with derivative terms [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(2): 25-31.
[3] CHEN Bin, Abuelgasimalshaby Elzebir. Existence and multiplicity results for a second-order multi-point boundary value problem at resonance [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(4): 49-52.
[4] CAI Jian-sheng1, GE Lian-sheng2. Independent numbers of graphs and fractional uniform graphs#br# [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2014, 49(04): 41-43.
[5] ZHANG Guo-wei 1, CHEN Ang2. Infinitely connectivity of the wandering domain of#br# Baker’s original example [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2014, 49(04): 70-73.
[6] WANG Wan-yu, MENG Ji-xiang*, ZHAO Xue-bing. The restricted neighbor connectivity of  line graphs [J]. J4, 2012, 47(2): 56-59.
[7] CHEN Tian-lan. Existence of solutions for a discrete three-point boundary value problems at resonance [J]. J4, 2010, 45(8): 81-86.
[8] XIAO Hai-qiang1,2, ZHANG Zhao1*. Characterization of λ3,q-connected graphs [J]. J4, 2010, 45(6): 27-30.
[9] LIU Shu-li. Isolated toughness and existence of fractional (g, f)-factors in graphs [J]. J4, 2010, 45(10): 31-34.
[10] QI Zhong-Bin, XIE Dong, ZHANG He-Beng. The relation between  cyclic edgeconnectivity and cyclic connectivity of 3regular connected graphs [J]. J4, 2009, 44(12): 22-24.
[11] WANG Bing . Properties of a quasi-claw-free graph [J]. J4, 2007, 42(10): 111-113 .
[12] WANG Ji-hui, . A sufficient condition on the edge covering coloring of nearly bipartite graphs [J]. J4, 2006, 41(1): 21-23 .
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd