J4 ›› 2008, Vol. 43 ›› Issue (12): 28-30.

• Articles • Previous Articles     Next Articles

 LIU Xiao-Yan   

  1. Department of Basic Courses, Shandong University of Science and Technology, Jinan 250031, Shandong, China
  • Received:2008-10-02 Online:2008-12-16 Published:2009-11-09

PDF (PC)

863

Abstract:

A graph G is called an ［s,t］-graph, if there are at least t edges in every induced subgraph of s vertices. Let G be a 2-connected ［4,2］-graph and the order of G be not less than 7, then G is a pancyclicity graph.

Key words: ［s,t］-graph; k-connected; pancyclicity graph

CLC Number: 

  • O157.5
[1] . On the Smarandachelyadjacentvertex edge coloring of some double graphs [J]. J4, 2009, 44(12): 25-29.
[2] DONG Ai-Jun, LI Guo-Jun, JU Jing-Song. List edge and list total colorings of planar graphs with adjacent triangles [J]. J4, 2009, 44(10): 17-20.
[3] WANG Chao. A degree condition for graphs to have Hamiltonian (g,f)-factors [J]. J4, 2009, 44(10): 21-25.
[4] LIU Shen-Sheng, SHU Zhi-Jiang. An upper bound on the vertex distinguishing IE total chromatic number of graphs [J]. J4, 2009, 44(10): 14-16.
[5] JU Jing-Song, LI Shuo, YANG Xin-Gang. Degree conditions for bipartite graphs to contain 6-cycles [J]. J4, 2009, 44(8): 13-15.
[6] GAO Yu-Fen, WEI Xiao-Li. On the extremal Merrifield-Simmons index with  respect to trees having given number of endvertices [J]. J4, 2009, 44(8): 16-20.
[7] YUAN Xiu-Hua. Signed edge total domination numbers of graphs [J]. J4, 2009, 44(8): 21-24.
[8] LIU Hai-Yang, MA Cheng-Gang, WANG Zhi-Beng. Graham's conjecture on the product of the thorn graph [J]. J4, 2009, 44(8): 25-30.
[9] DUAN Ci-Meng, LV Ping-Li, MIAO Lian-Yang, MIAO Zheng-Ke. L(2,1,1)-Labeling of simple graphs [J]. J4, 2009, 44(8): 31-34.
[10] GENG Jian-yan,YAN Jin,LI Feng . Vertex-disjoint 4-cycle in a bipartite graph [J]. J4, 2008, 43(5): 87-92 .
[11] PAN Rui-xia,LAN Mei,LIU Gui-zhen . A condition of isolated toughness on the existence of fractional ［a,b］-factors of graphs [J]. J4, 2008, 43(5): 93-96 .
[12] 林丽美1,2,周书明1,2,许力1,2. t／t-diagnosability and diagnosis algorithm on hierarchical cubic network [J]. J4, 2013, 48(7): 85-92.
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