𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On generic forms of complementary graphs

✍ Scribed by J.W. Moon; S.D. Bedrosian

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
250 KB
Volume
316
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

✦ Synopsis

Each graph may be associated with a certainfunction called its genericform. If one knows the generic forms of given graphs, then one can easily determine the number of spanning trees in graphs obtained from a complete multi-graph either (1) by adding, or (2) by deleting the edges of disjoint copies of the given graphs. Our objective here is to give a proof of a simple and useful relation between the generic forms of graphs that are complementary with respect to a complete multi-graph.

πŸ“œ SIMILAR VOLUMES

On Apolarity and Generic Canonical Forms
On Apolarity and Generic Canonical Forms
✍ Richard Ehrenborg πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 175 KB

The notion of S S-algebra is introduced. The theory of apolarity and generic canonical forms for polynomials is generalized to S S-algebras over the complex field ‫.ރ‬ We apply this theory to the problem of finding the essential rank of general, symmetric, and skew-symmetric tensors. Upper bounds fo

On regular self-complementary graphs
On regular self-complementary graphs
✍ Nora Hartsfield πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 74 KB

A 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.

On cyclically K-complementary graphs
On cyclically K-complementary graphs
✍ Jose M. Bernaldez πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 313 KB

Let {HiL,.,,,. ,x be an isomorphic factorization of K,. If there is a permutation p on V(K.) such that /j': V(H,)+ V(H,+ ,) is an isomorphism for i= 1,2, , k-1, then a graph isomorphic to Hi is called a cyclically k-complementary graph. In this paper, some theorems are presented to prove the exist

On linear vertex-arboricity of complemen
On linear vertex-arboricity of complementary graphs
✍ Yousef Alavi; Jiuqiang Liu; Jianfang Wang πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 323 KB πŸ‘ 1 views

## Abstract The 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 l

On strongly regular self - complementary
On strongly regular self - complementary graphs
✍ Sergio Ruiz πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 133 KB πŸ‘ 1 views

## Abstract It is shown that certain conditions assumed on a regular self‐complementary graph are not sufficient for the graph to be strongly regular, answering in the negative a question posed by Kotzig in [1].