On the characterization of potentially Κ1,1,s-graphic sequences

Authors

  • Yin, Meng-Xiao
  • Yin, Jian-Hua
  • Zhong, Cheng
  • Yang, Feng

Abstract

For given a graph H, a graphic sequence π = (d1, d 2,⋯, dn) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially Κ1,1,s-positive graphic sequences for s = 4 and 5, where Κ1,1,s is the 1 x 1 x s complete 3-partite graph. These characterizations imply the values of σ (Κ1,1,s,n) for s = 4 and 5.

Published

2011-06-09

How to Cite

Yin, Meng-Xiao, Yin, Jian-Hua, Zhong, Cheng, & Yang, Feng. (2011). On the characterization of potentially Κ1,1,s-graphic sequences. Utilitas Mathematica, 85. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/783

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.