Degree sequences of graphs containing a cycle with prescribed length

Title:

Degree sequences of graphs containing a cycle with prescribed length

Creator:

Yin, Jian-Hua

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:0ea440c8-abc6-4b84-9ca9-16d3f3d92999
uuid:0ea440c8-abc6-4b84-9ca9-16d3f3d92999

Subject:

graph, degree sequence, and potentially $C_r$-graphic sequence

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

Let $r\ge 3$, $n\ge r$ and $\pi =(d_1,d_2,\ldots ,d_n)$ be a non-increasing sequence of nonnegative integers. If $\pi $ has a realization $G$ with vertex set $V(G)=\{v_1,v_2,\ldots ,v_n\}$ such that $d_G(v_i)=d_i$ for $i=1,2,\ldots , n$ and $v_1v_2\cdots v_rv_1$ is a cycle of length $r$ in $G$, then $\pi $ is said to be potentially $C_r''$-graphic. In this paper, we give a characterization for $\pi $ to be potentially $C_r''$-graphic.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

481-487

Source:

Czechoslovak Mathematical Journal | 2009 Volume:59 | Number:2

Harvested from:

CDK

Metadata only:

false