The book thickness of nilpotent graphs
Let \(R\) be a commutative ring with nonzero identity and let \(Z_N(R)=\{y \in R: yz ~\text{is}~ \text{nilpotent for some}~z\in R^*=R \setminus \{0\} \}.\) The nilpotent graph \(\Gamma_N (R)\) of \(R\) is the graph whose vertex set coincide with \(Z_N(R)^{*}=Z_N(R)\setminus \{0\}\) and there is an edge between two distinct vertices \(x\) and \(y\) if and only if \(xy\) is nilpotent in \(R.\) An \(n\)-book is a joining of \(n\) pages (i.e., \(n\) half planes) along with the spine (i.e., a line segment). In an \(n\)-book, the embedding of a graph is to embed all the vertices linearly on a spine and every edge is embedded on any one page without crossings of the edges. The minimum number \(n\) such that the graph can be embedded in an \(n\)-book is called book thickness and it is denoted by \(bt(G).\) In this paper, the authors determine the exact value of the book thickness of all nilpotent graphs associated to commutative rings whose genus is at most one. Also, they investigate the book thickness of nilpotent graphs from local rings and some product rings.
- Book thickness of planar zero divisor graphs
- Book thickness of toroidal zero-divisor graphs
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- Nilpotent graphs of genus one
- On the pagenumber of complete bipartite graphs
- Pagenumber of complete bipartite graphs
- The book thickness of a graph
- The pagenumber of toroidal graphs is at most seven
This page was built for publication: The book thickness of nilpotent graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136363)
