In this paper we study the family of graphs which can be reduced to single vertices by recursively complementing all connected subgraphs. It is shown that these graphs can be uniquely represented by a tree where the leaves of the tree correspond to the vertices of the graph. From this tree ...
This article gives a survey of those results in the theory of graph spectra which can be described as characteriza-tions of sets of all graphs G such that both the graph G and its complement have a prescribed property.doi:10.1080/0308108031000108287M. PetroviZ. RadosavljeviS. SimiGordon ...
Instruction for Assignment One: Halfedge Data Structure and Cut Graph 614 -- 1:29:55 App Guest Lecture: Prof. Shibing Chen - Regularity Theory of Optimal Transportation 1937 1 1:54:16 App Lecture 0 (Part II) - Introduction to Computational Conformal Geometry 3426 -- 1:49:10 App Lecture...
GraphTheory GraphComplement construct complement of graph Calling Sequence Parameters Description Examples Calling Sequence GraphComplement( G ) Parameters G - graph Description GraphComplement returns the complement of a graph G , that is the graph...
It was proved recently by one of the authors that, if H is a path Pt (t>2 with t≠7 or 8) or an odd cycle Ct (t>3), then there is a unique maximal graph having H as a star complement for −2. The methods employed were analytical in nature, making use of the Reconstruction...
The complement of a simple graph, G, is the graph, G with the same vertices as G, in which there is an edge between two vertices if and only if there is no edge between those vertices in G. The complement of an angle A is another angle B such that the sum A + B equals 90°...
Determine all m, n \in N such that the complete bipartite graph K_{m,n} is Hamiltonian. 3. Use Green?s Theorem of the form F n ds = div F(x, y) dA, to prove Green?s first identity: f?2 g dA = (f?g) n ds ? ?f ?g dA, where D and C satisfy the hypotheses of Gre...
Answer to: Let G be a connected regular graph that is not Eulerian. Show that if the complement of G is connected, then the complement of G is ...
We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph. Both problems are NP-hard. We wri... Ames,BPW,Vavasis,... - 《Mathematical Programming》 被引量: 160发表: 2011年 Nonnegative Factorization and The Maximum Edge Bicliq...
COMPLEMENT THEOREMSMANIFOLDSSMOOTHINGA two-valued function f defined on the vertices of a graph G = ( V , E ), f : V → -1, 1, is a majority... I Broere,JH Hattingh,MA Henning,... - 《Discrete Mathematics》 被引量: 92发表: 1995年 Parametrized shape theory Parametrized versions of...