Name
Abstract | ||
|---|---|---|
Given a graph (resp. digraph) G with edge (resp. arc) set E(G)={(u\"1,v\"1),...,(u\"q,v\"q)}, where q=|E(G)|, we can associate with it an integer-pair sequence S=((a\"1,b\"1),...,(a\"q,b\"q)) where a\"i is the degree (resp. indegree) of u\"i and b\"i of v\"i. Then G is said to be a graph (resp. digraph) realization of S. In this paper we characterize integer-pair sequences which have a self-complementary graph (resp. digraph, tournament) as a realization. We then give a unified approach to characterizing integer-pair sequences as well as degree sequences which are graphic and have every graph realization self-complementary. Our characterization in the degree sequence case is different from that obtained earlier in Rao[13]. |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1016/0012-365X(83)90035-3 | Discrete Mathematics |
Field | DocType | Volume |
Integer,Discrete mathematics,Graph,Combinatorics,Tournament,Degree (graph theory),Mathematics,Digraph | Journal | 45 |
Issue | ISSN | Citations |
2-3 | Discrete Mathematics | 1 |
PageRank | References | Authors |
0.38 | 3 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Prabir Das | 1 | 16 | 5.20 |