Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Zhiguo Li
Hebei University of Technology
Electrical & Electronics Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Matching book thickness of generalized Petersen graphs Zeling Shao; Huiru Geng; Zhiguo Li
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 1 (2022): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2022.10.1.11

Abstract

The matching book embedding of a graph G is to place its vertices on the spine, and arrange its edges on the pages so that the edges in the same page do not intersect each other and the edges induced subgraphs of each page are 1-regular. The matching book thickness of G is the minimum number of pages required for any matching book embedding of G, denoted by mbt(G). In this paper, the matching book thickness of generalized Petersen graphs is determined.
The matching book embedding under some graph operations Zeling Shao; Min Yao; Zhiguo Li
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 1 (2026): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2026.14.1.13

Abstract

The matching book embedding of a graph G is an embedding of G with the vertices on the spine, and each edge within a single page so that the edges on each page do not intersect and the degree of vertices on each page is at most one. The matching book thickness of G is the minimum number of pages in a matching book embedding of G, denoted by mbt(G). In this paper, the exact matching book thickness of the corona product between a dispersible or nearly dispersible graph and a simple graph is determined. Additionally, the dispersibility of the edge product of a cycle and a simple graph is obtained. Finally the matching book thickness of the comb product of two dispersible graphs is obtained.
Co-Authors Huiru Geng Min Yao Zeling Shao Zeling Shao