Results 261 to 270 of about 1,324,556 (299)

Partitioning a Graph into Complementary Subgraphs

Graphs and Combinatorics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Julliano Rosa Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter   +2 more
openaire   +2 more sources

Supereulerian complementary graphs

Journal of Graph Theory, 1993
AbstractNebeský in [12] show that for any simple graph with n ≥ 5 vertices, either G or Gc contains an eulerian subgraph with order at least n ‐ 1, with an explicitly described class of exceptional graphs. In this note, we show that if G is a simple graph with n ≥ 61 vertices, then either G or Gc is supereulerian, with some exceptions.
openaire   +2 more sources

ON THE INDEPENDENCE NUMBERS OF COMPLEMENTARY GRAPHS

Transactions of the New York Academy of Sciences, 1974
AbstractA set of vertices (edges) is called independent if no two vertices (edges) in the set are adjacent. The independence number β(G) (edge independence number β1(G)) is the maximum number of elements in an independent set of vertices (edges) of G.
Chartrand, Gary, Schuster, Seymour
openaire   +2 more sources

Group connectivity of complementary graphs

Journal of Graph Theory, 2011
AbstractLet G be a 2‐edge‐connected undirected graph, A be an (additive) abelian group and A* = A−{0}. A graph G is A‐connected if G has an orientation D(G) such that for every function b: V(G)↦A satisfying , there is a function f: E(G)↦A* such that for each vertex v∈V(G), the total amount of f values on the edges directed out from v minus the total ...
Xinmin Hou, Hong-Jian Lai, Ping Li 0023, Cun-Quan Zhang   +3 more
openaire   +3 more sources

Self‐complementary symmetric graphs

Journal of Graph Theory, 1992
AbstractThe class of self‐complementary symmetric graphs is characterized using the classification of finite simple group.
openaire   +1 more source

On regular self‐complementary graphs

Journal of Graph Theory, 1987
AbstractA regular self‐complementary graph is presented which has no complementing permutation consisting solely of cycles of length four. This answers one of Kotzig's questions.
openaire   +2 more sources

On linear vertex‐arboricity of complementary graphs

Journal of Graph Theory, 1994
AbstractThe linear vertex‐arboricity ρ(G) of a graph G is defined to be the minimum number of subsets into which the vertex set of G can be partitioned such that each subset induces a linear forest. In this paper, we give the sharp upper and lower bounds for the sum and product of linear vertex‐arboricities of a graph and its complement.
Yousef Alavi, Jiuqiang Liu, Jianfang Wang   +2 more
openaire   +1 more source

Enumeration of Bipartite Self-Complementary Graphs

Graphs and Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Makoto Ueno, Shinsei Tazawa
openaire   +1 more source

Assortativity of complementary graphs

The European Physical Journal B, 2011
Newman's measure for (dis)assortativity, the linear degree correlation ρD, is widely studied although analytic insight into the assortativity of an arbitrary network remains far from well understood. In this paper, we derive the general relation (2), (3 )a nd Theorem1 between the assortativity ρD(G )o f a graph G and the assortativity ρD(G c ) of its ...
Wang, H. (author), Winterbach, W. (author), Van Mieghem, P.F.A. (author)   +2 more
openaire   +3 more sources

Self-complementary circulant graphs

Ars Comb., 1999
Summary: There exists a self-complementary circulant graph with \(n\) vertices if and only if every prime \(p\) in the prime factorization of \(n\) satisfies \(p \equiv 1\) (mod 4).
Brian Alspach, Joy Morris, V. Vilfred
openaire   +2 more sources