Enumeration theorem of (ν,ν/2+s)-odd graph for any ν even
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    For any v even, we study the enumeration of(v,v/2+s)-odd graph for0≤s≤3.Combining with the decomposition of graph with p(l≤p≤6) vertices,we construct a new graph Ga1,a2,am constituted by star graphs ●a1,●a2,…,●amthrough the arrangement of degree array we propose the enumeration theorem of nonisomorphic(v,v/2+s)-odd graph according to different degree array.

    Reference
    Related
    Cited by
Get Citation

LI Ming-chao, HUO Jing-jing. Enumeration theorem of (ν,ν/2+s)-odd graph for any ν even[J].,2012,29(1):107-108,112

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 12,2011
  • Revised:
  • Adopted:
  • Online: January 12,2015
  • Published:
Article QR Code