• DocumentCode
    517624
  • Title

    On super 3-restricted edge connectivity of regular strong product graphs with girth at least four

  • Author

    Qin, Yingying ; Xiong, Zhiping ; Wang, Jingyu

  • Author_Institution
    Dept. of Math. & Phys., Wuyi Univ., Jiangmen, China
  • Volume
    1
  • fYear
    2010
  • fDate
    30-31 May 2010
  • Firstpage
    542
  • Lastpage
    544
  • Abstract
    It is known that communication networks with topologies being super 3-restricted edge connected graphs are more reliable under some reasonable conditions. Let Gi be maximally edge connected ki - regular graphs with k i≥ 3, i = 1,2 . It is proved in this work that if g(Gi) ≥ 4 , then the strong product G1⊗G2 of graphs G1 and G2 is super 3 -restricted edge connected.
  • Keywords
    graph theory; communication networks; girth; product graphs; super 3-restricted edge connectivity; topologies; Communication networks; Electronic mail; Mathematics; Network topology; Physics; Telecommunication network reliability; edge connectivity; regular graphs; strong product;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networking and Digital Society (ICNDS), 2010 2nd International Conference on
  • Conference_Location
    Wenzhou
  • Print_ISBN
    978-1-4244-5162-3
  • Type

    conf

  • DOI
    10.1109/ICNDS.2010.5479264
  • Filename
    5479264
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=517624