On Potentially K2,2,1,1-graph Graphic Sequences

被引：0

作者：

Liu, Mingjing ^{[1
]}

Lai, Chunhui ^{[1
]}

机构：

[1] Zhangzhou Teachers Coll, Dept Math, Zhangzhou 363000, Fujian, Peoples R China

来源：

UTILITAS MATHEMATICA | 2011年 / 85卷

关键词：

graph; degree sequence; potentially K-2; K-2; K-1; K-1-graphic sequences; complete 4-partite graph; SMALLEST DEGREE SUM; EXTREMAL PROBLEM; LEHEL CONJECTURE; JACOBSON; ERDOS; TRUE;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

For given a graph H, a graphic sequence pi = (d(1), d(2), ..., d(n)) is said to be potentially H-graphic if there exists a realization of pi containing H as a subgraph. In this paper, we characterize the potentially K-2,K-2,K-1,K-1-graphic sequences where K-r,K-s,K-p,K-t is an r x s x p x t complete 4-partite graph. Up to now, characterization of potentially complete 4-partite graph with k(k <= 6) vertices has solved.

引用

页码：45 / 63

页数：19

共 42 条

[41] About chromatic uniqueness of complete tripartite graph K(s, s - 1, s - k), where k >= 1 and s - k >= 2
Gein, P. A.
SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2016, 13 : 331 - 337
[42] Analysis of thermo-physical properties and qualitative investigation of molecular interactions in terms of Graph Theoretical Approach in binary liquid mixtures containing 1-propanol + Amines (1,3-diaminopropane or 1,2-diaminopropane or 1-amino-2-propanol) at T=298.15-318.15 K
Parmar, Deepak
Kumari, Kavitha
Sharma, Anuradha
Sahal, Mustapha
Rani, Manju
Kumar, Naveen
JOURNAL OF MOLECULAR LIQUIDS, 2022, 368

← 1 2 3 4 5 →