The graphs with only self-dual signings
dc.contributor.author | Harary, Frank | en_US |
dc.contributor.author | Kommel, Helene J. | en_US |
dc.date.accessioned | 2006-04-07T17:39:14Z | |
dc.date.available | 2006-04-07T17:39:14Z | |
dc.date.issued | 1979 | en_US |
dc.identifier.citation | Harary, Frank, Kommel, Helene J. (1979)."The graphs with only self-dual signings." Discrete Mathematics 26(3): 235-241. <http://hdl.handle.net/2027.42/23703> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V00-45JC8VW-C6/2/5c344e51ec3decdff47b725af6350582 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/23703 | |
dc.description.abstract | Given a graph G, it is possible to attach positive and negative signs to its lines only, to its points only, or to both. The resulting structures 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 K2m, 2Km, mK2, Km + K2 or 2C4. The S-dual graphs are C6, 2C3, 2C4, 2K1n, 2nK2, K1,2n, nK1,2, K2n, Kn and all graphs obtained from these by the addition of isolated points. Finally, the only N-dual graph other than -K2n is 2K2. | en_US |
dc.format.extent | 685363 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | The graphs with only self-dual signings | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | University of Michigan, Ann Arbor, MI 48109, USA | en_US |
dc.contributor.affiliationum | University of Michigan, Ann Arbor, MI 48109, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/23703/1/0000675.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0012-365X(79)90029-3 | en_US |
dc.identifier.source | Discrete Mathematics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
-
Interdisciplinary and Peer-Reviewed
-
Mathematical Geography, Institute of (IMaGe)
Publications and Scholarly Research Projects.
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.