您当前的位置: > 详细浏览

Potentially Km-G-graphical Sequences: A Survey

请选择邀稿期刊:
摘要: The set of all non-increasing nonnegative integers sequence π = (d(v1), d(v2), ..., d(vn)) is denoted by NSn. A sequence π ∈ NSn is said to be graphic if it is the degree sequence of a simple graph G on n vertices, and such a graph G is called a realization of π. The set of all graphic sequences in NSn is denoted by GSn. A graphical sequence π is potentially H-graphical if there is a realization of π containing H as a subgraph, while π is forcibly H-graphical if every realization of π contains H as a subgraph. Let Kk denote a complete graph on k vertices. Let Km −H be the graph obtained from Km by removing the edges set E(H) of the graph H (H is a subgraph of Km). This paper summarizes briefly some recent results on potentially Km −G-graphic sequences and give a useful classification for determining σ(H, n).

版本历史

[V2] 2024-03-27 19:45:26 ChinaXiv:202210.00146V2 下载全文
[V1] 2022-10-22 12:42:02 ChinaXiv:202210.00146v1 查看此版本 下载全文
点击下载全文
预览
同行评议状态
通过
许可声明
metrics指标
  •  点击量6038
  •  下载量412
评论
分享