On Connected m-HPK(n1,n2,n3,n4)[Kt]-Residual Graphs
Author(s) -
Huiming Duan,
Yonghong Li
Publication year - 2013
Publication title -
journal of discrete mathematics
Language(s) - English
Resource type - Journals
eISSN - 2090-9837
pISSN - 2090-9845
DOI - 10.1155/2013/983830
Subject(s) - algorithm , computer science
We define m-HPK(n1,n2,n3,n4)[Kt]-residual graphs in which HPK is a hyperplane complete graph. We extend P. Erdös, F. Harary, and M. Klawe's definition of plane complete residual graph to hyperplane and obtain the hyperplane complete residual graph. Further, we obtain the minimum order of HPK(n1,n2,n3,n4)[Kt]-residual graphs and m-HPK(n1,n2,n3,n4)[Kt]-residual graphs. In addition, we obtain a unique minimal HPK(n1,n2,n3,n4)[Kt]-residual graphs and a unique minimal m-HPK(n1,n2,n3,n4)[Kt]-residual graphs
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom