Search results
Results From The WOW.Com Content Network
The complete list of all free trees on 2, 3, and 4 labeled vertices: = tree with 2 vertices, = trees with 3 vertices, and = trees with 4 vertices.. In combinatorics, an area of mathematics, graph enumeration describes a class of combinatorial enumeration problems in which one must count undirected or directed graphs of certain types, typically as a function of the number of vertices of the ...
Graph homomorphism problem [3]: GT52 Graph partition into subgraphs of specific types (triangles, isomorphic subgraphs, Hamiltonian subgraphs, forests, perfect matchings) are known NP-complete. Partition into cliques is the same problem as coloring the complement of the given graph. A related problem is to find a partition that is optimal terms ...
Resolving sets for graphs were introduced independently by Slater (1975) and Harary & Melter (1976), while the concept of a resolving set and that of metric dimension were defined much earlier in the more general context of metric spaces by Blumenthal in his monograph Theory and Applications of Distance Geometry. Graphs are special examples of ...
The problems (with their original names) are: Graph isomorphism This problem is known to be in NP, but it is unknown if it is NP-complete. Subgraph homeomorphism (for a fixed graph H) Graph genus; Chordal graph completion; Chromatic index [4] Spanning tree parity problem [5] Partial order dimension; Precedence constrained 3-processor scheduling
The English term monograph is derived from modern Latin monographia, which has its root in Greek. [1] In the English word, mono-means ' single ' and -graph means ' something written '. [2] Unlike a textbook, which surveys the state of knowledge in a field, the main purpose of a monograph is to present primary research and original scholarship ...
In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete.In his 1972 paper, "Reducibility Among Combinatorial Problems", [1] Richard Karp used Stephen Cook's 1971 theorem that the boolean satisfiability problem is NP-complete [2] (also called the Cook-Levin theorem) to show that there is a polynomial time many-one reduction ...
The 1980 monograph Spectra of Graphs [16] by Cvetković, Doob, and Sachs summarised nearly all research to date in the area. In 1988 it was updated by the survey Recent Results in the Theory of Graph Spectra. [17] The 3rd edition of Spectra of Graphs (1995) contains a summary of the further recent contributions to the subject. [15]
More generally, the monographs are intended for the wide circle of thoughtful people familiar with basic graduate or advanced undergraduate mathematics encountered in the study of mathematics itself or in the context of related disciplines who wish to extend their knowledge without prolonged and critical study of the mathematical journals and ...