DOIAbstract
AbstractIn this paper a new algorithm is given for the construction of self-complementary graphs, and results concerning structural properties and adjacency matrices of these graphs are presented
AbstractIn this paper a new algorithm is given for the construction of self-complementary graphs, and results concerning structural properties and adjacency matrices of these graphs are presented
We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n ...
AbstractA new method of studying self-complementary graphs, called the decomposition method, is prop...
AbstractGiven a graph H with 2p vertices, the necessary and sufficient condition for the existence o...
AbstractIn this paper a new algorithm is given for the construction of self-complementary graphs, an...
AbstractGiven a graph H with 2p vertices, the necessary and sufficient condition for the existence o...
AbstractIn this paper, we describe the structure of separable self-complementary graphs
AbstractKnown necessary conditions for realization of a sequence of integers as the degrees of a sel...
AbstractA new method of studying self-complementary graphs, called the decomposition method, is prop...
AbstractDe Bruijn [I] applied his genoralization of PÓlya's fundamental theorem to provide an outlin...
AbstractGraphs self-complementary in Kn—e exist for those values of n where self-complementary graph...
A self-complementary graph G of odd order has a unique decomposition into edge disjoint subgraphs, o...
A self complementary (SC) graph is a graph that is isomorphic to its complement. Clapham showed that...
A self complementary (SC) graph is a graph that is isomorphic to its complement. Clapham showed that...
A self complementary (SC) graph is a graph that is isomorphic to its complement. Clapham showed that...
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc ...
We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n ...
AbstractA new method of studying self-complementary graphs, called the decomposition method, is prop...
AbstractGiven a graph H with 2p vertices, the necessary and sufficient condition for the existence o...
AbstractIn this paper a new algorithm is given for the construction of self-complementary graphs, an...
AbstractGiven a graph H with 2p vertices, the necessary and sufficient condition for the existence o...
AbstractIn this paper, we describe the structure of separable self-complementary graphs
AbstractKnown necessary conditions for realization of a sequence of integers as the degrees of a sel...
AbstractA new method of studying self-complementary graphs, called the decomposition method, is prop...
AbstractDe Bruijn [I] applied his genoralization of PÓlya's fundamental theorem to provide an outlin...
AbstractGraphs self-complementary in Kn—e exist for those values of n where self-complementary graph...
A self-complementary graph G of odd order has a unique decomposition into edge disjoint subgraphs, o...
A self complementary (SC) graph is a graph that is isomorphic to its complement. Clapham showed that...
A self complementary (SC) graph is a graph that is isomorphic to its complement. Clapham showed that...
A self complementary (SC) graph is a graph that is isomorphic to its complement. Clapham showed that...
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc ...
We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n ...
AbstractA new method of studying self-complementary graphs, called the decomposition method, is prop...
AbstractGiven a graph H with 2p vertices, the necessary and sufficient condition for the existence o...
Add to ORKG