๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The graphs with only self-dual signings

โœ Scribed by Frank Harary; Helene J. Kommel

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
669 KB
Volume
26
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Given a graph G, it is possible to attach positive and negative sigis to its lines only, to its points only, or to both. The resulting structu-es are called respectively signed graphs, marked graphs and nets. The dual of each such structure is obtained by changing every sign in it. We determine all graphs G for which every suitable marked graph on G is self-dual (the M-dual graphs), and also the corresponding graphs G for signed graphs (S-dual) and for nets (N-dual.

A graph G is M-dual if and only if G or G is one of the graphs K,

๐Ÿ“œ SIMILAR VOLUMES

A Family of special outerplanar graphs w
A Family of special outerplanar graphs with only one triangle satisfying the cycle basis interpolation property
โœ Liu Yan ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 268 KB

The length of a cycle basis of a graph G is the sum of the lengths of its cycles. Let c-, c+ be the lengths of the minima1 and maxima1 cycle basis, respectively. Then G has the cycle basis interpolation property (chip) if for all integers c, c-< c < c+, there exists a cycle basis of length c. In thi

The [52, 26, 10] Binary Self-Dual Codes
The [52, 26, 10] Binary Self-Dual Codes with an Automorphism of Order 7
โœ W.Cary Huffman; Vladimir D. Tonchev ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 229 KB

All [52, 26,10] binary self-dual codes with an automorphism of order 7 are enumerated. Up to equivalence, there are 499 such codes. They have two possible weight enumerators, one of which has not previously arisen. 2001 Academic Press 1. INTRODUCTION In [1], Conway and Sloane present an upper bound