DOIAbstract
AbstractA formula for the number am(2n) of self-complementary m-placed relations is given. Then we obtain from this formula asymptotic results, e.g.am(2n) ∼ (2(2n) m2−n)/
AbstractA formula for the number am(2n) of self-complementary m-placed relations is given. Then we obtain from this formula asymptotic results, e.g.am(2n) ∼ (2(2n) m2−n)/
AbstractGraphs self-complementary in Kn—e exist for those values of n where self-complementary graph...
AbstractA graph is self-complementary if it is isomorphic to its complement. A graph is vertex trans...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
AbstractA formula for the number am(2n) of self-complementary m-placed relations is given. Then we o...
AbstractFor functions f : D → Rk where D is a finite set and Rk = {0,1,… k} we define complementary ...
AbstractFor functions f : D → Rk where D is a finite set and Rk = {0,1,… k} we define complementary ...
AbstractDe Bruijn [I] applied his genoralization of PÓlya's fundamental theorem to provide an outlin...
AbstractDe Bruijn [I] applied his genoralization of PÓlya's fundamental theorem to provide an outlin...
AbstractIn this paper a new algorithm is given for the construction of self-complementary graphs, an...
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...
AbstractIt is shown that the number of triangles in a self-complementary graph with N vertices is at...
AbstractA graph is self-complementary if it is isomorphic to its complement. A graph is vertex trans...
AbstractGraphs self-complementary in Kn—e exist for those values of n where self-complementary graph...
AbstractGraphs self-complementary in Kn—e exist for those values of n where self-complementary graph...
AbstractA graph is self-complementary if it is isomorphic to its complement. A graph is vertex trans...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
AbstractA formula for the number am(2n) of self-complementary m-placed relations is given. Then we o...
AbstractFor functions f : D → Rk where D is a finite set and Rk = {0,1,… k} we define complementary ...
AbstractFor functions f : D → Rk where D is a finite set and Rk = {0,1,… k} we define complementary ...
AbstractDe Bruijn [I] applied his genoralization of PÓlya's fundamental theorem to provide an outlin...
AbstractDe Bruijn [I] applied his genoralization of PÓlya's fundamental theorem to provide an outlin...
AbstractIn this paper a new algorithm is given for the construction of self-complementary graphs, an...
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...
AbstractIt is shown that the number of triangles in a self-complementary graph with N vertices is at...
AbstractA graph is self-complementary if it is isomorphic to its complement. A graph is vertex trans...
AbstractGraphs self-complementary in Kn—e exist for those values of n where self-complementary graph...
AbstractGraphs self-complementary in Kn—e exist for those values of n where self-complementary graph...
AbstractA graph is self-complementary if it is isomorphic to its complement. A graph is vertex trans...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
Add to ORKG