A complete characterization of graphic sequences with a Z3-connected realization
| Autor: | Jian-Hua Yin, Xiang-Yu Dai |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Discrete mathematics
Sequence Simple graph 020206 networking & telecommunications Cyclic group 0102 computer and information sciences 02 engineering and technology Characterization (mathematics) 01 natural sciences Combinatorics 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Discrete Mathematics and Combinatorics Order (group theory) Realization (systems) Connectivity Mathematics |
| Zdroj: | European Journal of Combinatorics. 51:215-221 |
| ISSN: | 0195-6698 |
| DOI: | 10.1016/j.ejc.2015.05.008 |
| Popis: | A non-increasing sequence π = ( d 1 , d 2 , ? , d n ) of non-negative integers is said to be graphic if it is the degree sequence of a simple graph G on n vertices. We say that G is a realization of π (or π is realizable by G ). Let Z 3 be a cyclic group of order three. If π has a realization G which is Z 3 -connected, then π has a Z 3 -connected realization G . Yang et?al. (2014) proposed the following problem: Characterize all graphic sequences π realizable by a Z 3 -connected graph. In this paper, we solve this problem completely and present a complete characterization of graphic sequences with a Z 3 -connected realization. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect