Graphic sequences with a realization containing cycles C3,…,Cℓ
| Autor: | Kun Ye, Jian-Hua Yin, Jia-Yun Li |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Combinatorics
0209 industrial biotechnology Computational Mathematics Sequence 020901 industrial engineering & automation Simple graph Integer Applied Mathematics 0202 electrical engineering electronic engineering information engineering 020206 networking & telecommunications 02 engineering and technology Realization (systems) Mathematics |
| Zdroj: | Applied Mathematics and Computation. 353:88-94 |
| ISSN: | 0096-3003 |
| Popis: | A non-increasing sequence π = ( d 1 , … , d n ) of nonnegative integers is said to be graphic if it is realizable by a simple graph G on n vertices. A graphic sequence π = ( d 1 , … , d n ) is said to be potentially 3Cl-graphic if there is a realization of π containing cycles of every length r, 3 ≤ r ≤ l. Li et al. proposed a problem about giving a criteria of potentially 3Cl-graphic sequences. For l = 5 , 6 , Chen et al. investigated this problem and showed that if d l ≥ l 2 , then π is potentially 3Cl-graphic. In this paper, we extend the above results of Chen et al. for l = 5 , 6 to the general case l ≥ 5, and prove that for every integer l ≥ 5, if d l ≥ l 2 , then π is potentially 3Cl-graphic. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect