Single-row transformation of complete graphs

• Main Authors: Salleh, Shahruddin Hussain, Olariu, Stephan, Sanugi, Bahrom, Aziz, Mohd Ismail Abd
• Format: Article
• Language: English
• Published: Springer 2005
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://eprints.utm.my/id/eprint/7532/1/Salleh_Shaharuddin_2005_Single-Row_Transformation_Complete_Graphs.pdf; http://eprints.utm.my/id/eprint/7532/; http://dx.doi.org/10.1007/s11227-005-0184-4

A complete graph is a fully-connected graph where every node is adjacent to all other nodes in the graph. Very often, many applications in science and engineering are reducible to this type of graph. Hence, a simplified form of a complete graph contributes in providing the solutions to these problem...