2012/10/18 by Leonid Malinin, Malinin, Leonid, Natalia Malinina +1
Computer Science · #05C35 #05C45 #05Cxx: 05C60 #Advanced Graph Theory Research #FOS: Mathematics #General Mathematics (math.GM) #Graph Labeling and Dimension Problems #Interconnection Networks and Systems
paper · pdf · doi:10.48550/arxiv.1210.6088
openalex publication_date 2012/10/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The presented material continues the previous article (arxiv:1007.1059) and also is devoted to the equivalent conversion between the graphs. The examining of the transformation of the vertex graphs into the edge graphs (together with the opposite transformation) illustrates the reasons of the appearance of NP-completeness from the point of view of the graph theory. We suggest that it also illustrates the synchronous possibility and impossibility of the struggle with NP-completeness.