ISSN 0253-2778

CN 34-1054/N

open
Free to Publish. Free to Read.
Open AccessOpen Access JUSTC Original Paper

The maximum Laplacian separators of bicyclic and tricyclic graphs

  • 1.

    School of Mathematics and Computation Sciences, Anqing Normal University, Anqing 246133, China

  • 2.

    School of Mathematics and Statistics, Guizhou University, Guiyang 550025, China

Cite this: JUSTC, 2017, 47(9): 733-737
https://doi.org/10.3969/j.issn.0253-2778.2017.09.004
Funds: Supported by National Natural Science Foundation of China (11371028), NSF of Anhui Province (11040606M14), NSF of Department of Education of Anhui Province (KJ2015ZD27, KJ2017A362).
More Information
  • Corresponding author:

    YU Guidong(corresponding author), female, born in 1973, PhD/Prof. Research field: Graph theory. E-mail: guidongy@163.com

  • Received Date: March 13, 2016
  • Revised Date: December 28, 2016
  • Accepted Date: December 28, 2016
  • Published Date: September 29, 2017
    Abstract
  • Let G be an undirected simple graph of order n, L(G) be the Laplacian matrix of G, and μ1(G)≥μ2(G) ≥…≥μn(G) be the eigenvalues of L(G). The Laplacian separator of G is defined as SL(G)=μ1(G)-μ2(G). Here the maximum Laplacian separators of bicyclic and tricyclic graphs of a given order were studied, and the corresponding extremal graphs were characterized.
    • FullText(HTML)
    References (15)
    Related Articles
    Track Citations

Catalog

    Get Citation
    {{if article.pdfAccess}}
    {{if article.articleBusiness.pdfLink && article.articleBusiness.pdfLink != ''}} {{else}} {{/if}}PDF
    {{/if}}
    XML
    [1]
    HELLESETH T, KUMAR P V. Sequences with low correlation[C]// Handbook of Coding Theory. Amsterdam: Elsevier, 1998.
    [2]
    LI N, TANG X H, HELLESETH T. New M-ary sequences with low autocorrelation from interleaved technique[J]. Des Codes Crytogr, 2014, 73: 237-249.
    [3]
    DING C. Codes From Difference Sets[M]. Singapore: World Scientific, 2015.
    [4]
    ZHU S X, WANG Y, SHI M J. Some results on cyclic codes over F2+vF2[J]. IEEE Trans Inform Theory, 2010, 56(4): 1680-1684.
    [5]
    KUMAR P V, HELLESETH T, CALDERBANK A R. An upper bound for Weil exponential sums over Galois rings and applications[J]. IEEE Trans Inform Theory, 1995, 41(2): 456-468.
    [6]
    KUMAR P V, HELLESETH T, CALDERBANK A R, et al. Large families of quaternary sequences with low correlation[J]. IEEE Trans Inform Theory, 1996, 42(2): 579-592.
    [7]
    SHANBHAG A, KUMAR P V, HELLESETH T. Improved binary codes and sequences families from Z4-linear codes[J]. IEEE Trans Inform Theory, 1996, 42(5): 1582-1586.
    [8]
    ZINOVIEV D V, SOL P. Quaternary codes and biphase sequences from Z8-codes[J]. Problems of Information Transmission, 2004, 40(2): 147-158 (translated from Problemy Peredachi Informatsii, 2004, 2: 50-62).
    [9]
    HU H G, FENG D G, WU W L. Incomplete exponential sums over Galois rings with application to some binary sequences derived from Z2l[J]. IEEE Trans Inform Theory, 2006, 52(5): 2260-2265.
    [10]
    LAHTONEN J, LING S, SOL P, ZINOVIEV D V. Z8-Kerdock codes and pseudo-random binary sequences[J]. J Complexity, 2004, 20: 318-330.
    [11]
    WAN Z X. Finite Fields and Galois Rings[M]. Singapore: World Scientific, 2003.
    [12]
    LIDL R, NIEDERREITER H. Finite Fields[M]. Cambridge, UK: Cambridge University Press, 1997.
    [13]
    GOLOMB S W, GONG G. Signal Design for Good Correlation for Wireless Communication, Cryptography and Radar[M]. New York: Cambridge University Press, 2005.
    [14]
    LING S, BLACKFORD J T. Zpk+1-linear codes[J]. IEEE Trans Inform Theory, 2002, 48(9): 2592-2605.
    [15]
    HAMMONS A R Jr, KUMAR P V, CALDERBANK A R, et al. The Z4-linearity of Kerdock, Preparata, Goethals, and related codes[J]. IEEE Trans Inform Theory, 1994, 40(2): 301-309.

    Related Articles

    [1]Siqi Tan, Li Chen, Weidong Wang. Coded computing for distributed graph-based semi-supervised learning[J]. JUSTC, 2023, 53(4): 0401. DOI: 10.52396/JUSTC-2022-0133
    [2]Zelin Ren, Xinmin Hou. Pancyclicity of randomly perturbed digraph[J]. JUSTC, 2022, 52(5): 2-1-2-6. DOI: 10.52396/JUSTC-2021-0208
    [3]JU Hongjuan, LEI Yingjie. The maximum signless Laplacian separator of tricyclic and quadricyclic graphs[J]. JUSTC, 2020, 50(4): 402-408. DOI: 10.3969/j.issn.0253-2778.2020.04.003
    [4]WANG Lixiang, YU Guidong, XU Yi. Sufficient conditions for a graph to be Hamilton-connected and traceable from every vertex[J]. JUSTC, 2020, 50(2): 100-105. DOI: 10.3969/j.issn.0253-2778.2020.02.003
    [5]HAO Huanhuan. Principal eigenvectors of nonnegative tensors and hypergraphs[J]. JUSTC, 2019, 49(11): 897-901. DOI: 10.3969/j.issn.0253-2778.2019.11.005
    [6]ZHAO Hongting, ZHANG Hailiang. New upper and lower bound for the signless Laplacian spectral radius[J]. JUSTC, 2015, 45(12): 972-975. DOI: 10.3969/j.issn.0253-2778.2015.12.002
    [7]FANG Yi. A new proof of the classification of solutions to some linearized fractional Yamabe type equations[J]. JUSTC, 2015, 45(12): 967-971. DOI: 10.3969/j.issn.0253-2778.2015.12.001
    [8]LI Xiaoxin, ZHA Shuping. Minimum distance signless Laplacian spectral radius of connected graphs with cut vertices[J]. JUSTC, 2014, 44(12): 982-985. DOI: 10.3969/j.issn.0253-2778.2014.12.003
    [9]YU Guidong, GONG Qijuan, DUAN Lan. The distance signless Laplacian spectral radius of trees with n-3 pendent vertices[J]. JUSTC, 2014, 44(3): 176-180. DOI: 10.3969/j.issn.0253-2778.2014.03.002
    [10]WU Min, PAN Yongliang. Two results on the signless Laplacian matrix of a graph[J]. JUSTC, 2014, 44(3): 173-175. DOI: 10.3969/j.issn.0253-2778.2014.03.001
    TrendMD
    Volume 47 Issue 9 PP. 733-737
    Cover

    Article Metrics

    Article views (99) PDF downloads (173)

    Copyright © Editorial Office of JUSTC, All Rights Reserved. 皖ICP备05002528号

    Supported by: Beijing Renhe Information Technology Co., Ltd.  Baidu Analytics

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return