Cycle Properties of s-Vertex Connected Graphs

Xing Bin Ma; Xiao Yan Liu; Lai Liang Zhang; Qiang Lv

doi:10.4028/www.scientific.net/AMR.756-759.4703

Paper Titles

Study on Recognition of Black Insects on Dark Background by Computer Vision
p.4685

Finite Element Analysis of Nozzle Dimension Influence on Fluidic Gyroscope Performance
p.4690

Based on Interval-Valued Intuitionistic Fuzzy Information of Joint Operations Commander and Staff Ability Assessment
p.4694

Mathematical Model Studies on Dispersion of Fine Non-Spherical Particles in Enclosed Spaces
p.4699

Cycle Properties of s-Vertex Connected Graphs
p.4703

Level of Repair Analysis Oriented on Integrated Materiel Support Based on BP Neural Network
p.4706

A Study on Grey Correlation Degree Model of Venture Capital Intrinsic Value
p.4710

The R&D Research of Digital Content Platform Analysis Based on Numerical Simulation
p.4716

Contrastive Studies of Pun in Figures of Speech
p.4721

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 756-759Cycle Properties of s-Vertex Connected Graphs

Cycle Properties of s-Vertex Connected Graphs

Abstract:

The cycle properties of-vertex connected graph are studied as follows pancyclicity and fully cycle extensibility. Two conclusions are drawn by way of argument: Let be a-vertex connected graph, if ,then is fully cycle extendable. Here the upper bound of is best possible. Let be a-vertex connected graph, if ,then is a pancyclic graph or .

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

4703-4705

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.756-759.4703

Citation:

Cite this paper

Online since:

September 2013

Authors:

Xing Bin Ma, Xiao Yan Liu, Lai Liang Zhang, Qiang Lv

Keywords:

Connected, Fully Cycle Extensibility, Pancyclicity, s-Vertex Connected Graph

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Bondy J A, Murty U. R. Graph Theory with Applications[M]. New York: Macmillan London and Elsevier, (1976).

Google Scholar

[2] G R T Hendry. Extending cycles in graphs[ J] . Discrete Math, 1990, 85: 59- 72.

Google Scholar

[3] Ma. H. J. K3. 4- Extensibility of Fully Cycle of Limited Graph and Its Application[D]. Jinan: Shandong Normal University, (2006).

Google Scholar

[4] Shi. Y.H. Qu. X. Y. Full Cycle extension of strong quasi – claw – free graphs. Journal of Shandong Normal University, 2006, 21(2): 5-7.

Google Scholar

[5] LIU.X.Y., Zhang. L.L. , Tan.L. . Extensibility of Fully Cycle of 5- Vertex Connected Graphs [J]. Journal of Shandong University of Science and Technology ( Natural Science): 2006, 25(04): 107-109.

Google Scholar

[6] Bondy J A. Pancycle Graphs I.J. Combin. Theroy(Series B), 1971, 11: 80-84.

Google Scholar