scientific article; zbMATH DE number 3997851

From MaRDI portal
Publication:4724672





[For the entire collection see Zbl 0564.00004.] The paper presents a number of formulas for describing the binding number for different kind of lexicographic products of graphs. The most important considered cases are as \(follows:\) H\(=L_ n(G)\), where \(L_ n\) is a path on \(n\geq 2\) vertices; \(H=C_ n(G)\), where \(C_ n\) is a cycle of length \(n\geq 3\); \(H=L_ n(L_ m)\); \(H=C_ m(L_ n)\); \(H=L_ n(K_{a,b})\); (for \(n\geq 2\), \(a\geq b\geq 1)\); \(H=C_ n(K_{a,b})\) (for \(n\geq 3\), \(a\geq b\geq 1)\); \(H=K_{a,b}(G)\) (for \(a\geq b\geq 1)\); \(H=K_{a,b}(C_ m)\) (for \(m\geq 3\), \(a\geq b\geq 1)\); \(H=K_{a,b}(K_{c,d})\) (for \(a\geq b\geq 1\), \(c\geq d\geq 1)\).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4724672)