On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs (Q2249944): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58920377, #quickstatements; #temporary_batch_1703768564763 |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 07:14, 2 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs |
scientific article |
Statements
On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs (English)
0 references
4 July 2014
0 references
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.
0 references
hyperplane complete graph
0 references
hyperplane complete residual graph
0 references