It is well known that a graph G of orderp 2 3 is Hamilton-connected if d(u) +d(v) 2 p + 1 for each pair of nonadjacent vertices u and w. In this paper we consider connected graphs G of order at least 3 for which where N ( z ) denote the neighborhood of a vertex z. We prove that a graph G satisfying
Some panconnected and pancyclic properties of graphs with a local ore-type condition
β Scribed by A. S. Asratian; G. V. Sarkisian
- Publisher
- Springer Japan
- Year
- 1996
- Tongue
- English
- Weight
- 699 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
For an integer i, a graph is called an L,-graph if, for each triple of vertices u, u , w with and Khachatrian proved that connected Lo-graphs of order a t least 3 are hamiltonian, thus improving Ore's Theorem. All K1,3-free graphs are L1-graphs, whence recognizing hamiltonian L1-graphs is an NP-com
## Abstract Twelve properties of a highly heterogeneous class of organic solvents have been modeled with a graphβtheoretical molecular connectivity modified (MC) method, which allows to encode the core electrons and the hydrogen atoms. The graphβtheoretical method uses the concepts of simple, gener
## Abstract ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a βFull Textβ option. The original article is trackable v