Results 11 to 20 of about 5,433,596 (264)
Construction of self-complementary graphs [PDF]
Discrete Mathematics, 1997 Given a graph H with 2p vertices, the necessary and sufficient condition for the existence of a self-complementary graph G of order 4p containing a pair of edge disjoint subgraphs H1 and H2 such that H ≅ H1 and H ⋍ H2 is presented.
Nair, P.S.
core +3 more sources
Self-complementary graphs [PDF]
Journal of Combinatorial Theory, Series B, 1974 In 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 ...
Gibbs, Richard A, Richard A Gibbs
core +4 more sources
Graphs self-complementary in Kn—e [PDF]
Discrete Mathematics, 1990 Graphs self-complementary in Kn—e exist for those values of n where self-complementary graphs do not exist. For these graphs, the structure of the complementing permutation is analysed and their diameter is determined.
Clapham, C.R.J.
core +2 more sources
Self-complementary two-graphs and almost self-complementary double covers [PDF]
European Journal of Combinatorics, 2007 A graph X is called almost self-complementary with respect to a perfect matching I if it is isomorphic to the graph obtained from its complement Xc by removing the edges of I.
Potočnik, Primož, Šajna, Mateja
core +2 more sources
Local coloring of self complementary graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph. A local coloring of a graph of order at least 2 is a function having the property that for each set with , there exist vertices such that , where is the size of the induced subgraph .
P. Deepa +2 more
doaj +2 more sources
Hamiltonian-connected self-complementary graphs [PDF]
Discrete Mathematics, 1994 A self-complementary graph having a complementing permutation σ = [1, 2, 3, …, 4k], consisting of one cycle, and having the edges (1, 2) and (1, 3) is strongly Hamiltonian iff it has an edge between two even-labelled vertices.
Carrillo, Luis D., Luis D. Carrillo
core +3 more sources
On self-complementary strongly regular graphs [PDF]
Discrete Mathematics, 1988 A complete enumeration is carried out of self-complementary strongly regular graphs with fewer than 53 vertices. New necessary conditions are derived for the cycles of complementing permutations and for the block valencies of the corresponding induced ...
Mathon, Rudolf
core +3 more sources
Characterization of self-complementary graphs with 2-factors [PDF]
Discrete Mathematics, 1977 Let G be a self-complementary graph (s.c.) and π its degree sequence. Then G has a 2-factor if and only if π - 2 is graphic. This is achieved by obtaining a structure theorem regarding s.c. graphs without a 2-factor.
Rao, S.Bhaskara
core +3 more sources
Self-complementary Graphs [PDF]
, 2017 Samokomplementarni grafovi su zanimljivi jer čine beskonačnu klasu grafova i imaju jaka strukturna svojstva. Na primjer, samokomplementaran graf mora imati točno \(\frac{n(n-1)}{4}\) bridova, radijus 2, dijametar 2 ili 3 i oni postoje za sve izvodive n.
Prgomet, Svjetlana
core +2 more sources
Equienergetic self-complementary graphs [PDF]
, 2004 summary:In this paper equienergetic self-complementary graphs on $p$ vertices for every $p=4k$, $k \geq 2$ and $p=24t+1$, $t \geq 3$ are ...
Vijayakumar, A. +2 more
core +1 more source