On connected m-HPK(n₁,n₂,n₃,n₄)[K_t]-residual graphs
Summary: We define \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs in which \(\mathrm{HPK}\) is a hyperplane complete graph. We extend \textit{P. Erdős} et al.'s definition of plane complete residual graph [Ann. Discrete Math. 6, 117--123 (1980; Zbl 0451.05040)] to hyperplane and obtain the hyperplane complete residual graph. Further, we obtain the minimum order of \(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs and \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs. In addition, we obtain a unique minimal \(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs and a unique minimal \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs.
- On connected \(m\)-\(\mathrm{HPK} (n_1, n_2, n_3, n_4)\)-residual graphs
- On connected K_n-residual graphs
- On connected m-K₂-residual graphs.
- On connected 2-K_n-residual graphs
- A note on connected \(2\)-\({K_n}\)-residual graphs
- scientific article; zbMATH DE number 6401392
- On connected m multiply 2 dimensions composite hyperplane complete graph's residual graphs
- On hamiltonian connectedness of \(K_{1,4}\)-free graphs
- k-Independence and thek-residue of a graph
- On the k-residue of disjoint unions of graphs with applications to k-independence
- An isomorphic factorization of the complete graph
- Graph theory
- Isomorphic factorization of de Bruijn digraphs
- On the gracefulness of the graph \(P_{2m,2n}\)
- Residual properties of simple graphs
- Residual reliability of P-threshold graphs
- Residually complete graphs with odd order
- Residually-Complete Graphs
- The isomorphic factorization of complete tripartite graphs \(K(m,n,s)\).--- A proof of F. Harary, R.W. Robinson and N.C. Wormald's conjectureure
This page was built for publication: On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249944)
