Graphical sequences of some family of induced subgraphs

Journal of Algebra Combinatorics Discrete Structures and Applications

article

S. Pirzada¹  Bilal A. Chat¹  Farooq A. Dar¹ 

[1] Department of Mathematics, University of Kashmir

关键词: Graphical sequences;    Subdivision graph;    Join of graphs;    Split graph;   

DOI  :  10.13069/jacodesmath.39202

学科分类：社会科学、人文和艺术（综合）

来源: Yildiz Technical University

【 摘 要 】

The subdivision graph S(G) of a graph G is the graph obtained by inserting a new vertex into everyedge of G. The Svertex or Sver join of the graph G1 with the graph G2, denoted by G1∨˙ G2, isobtained from S(G1) and G2 by joining all vertices of G1 with all vertices of G2. The Sedge or Sedjoin of G1 and G2, denoted by G1∨¯G2, is obtained from S(G1) and G2 by joining all vertices of S(G1)corresponding to the edges of G1 with all vertices of G2. In this paper, we obtain graphical sequencesof the family of induced subgraphs of SJ = G1 ∨ G2, Sver = G1∨˙ G2 and Sed = G1∨¯G2. Also weprove that the graphic sequence of Sed is potentially K4 − e-graphical.

【 授权许可】

CC BY