Paper Info
Title
The largest demigenus of a bipartie signed graph
Abstract
A graph with signed edges is orientation embedded in a surface when it is topologically embedded so that one trip around a closed path preserves or reverses orientation according as the path's sign product is positive or negative. We find the smallest surface within which it is possible to orientation-embed the complete bipartite signed graph ±K r,s , which is obtained from the complete bipartite graph K r,s through replacing each edge by two parallel edges, one positive and the other negative. We discuss some consequences and related problems.
Year
DOI
Venue
2001
10.1016/S0012-365X(00)00349-6
Discrete Mathematics
Keywords
Field
DocType
primary 05c10,maximal embedding surface,forbidden minors,minimal embedding surface,orientation embedding,largest demigenus,complete bipartite signed graph,secondary 05c83,antipodal embedding,05c22,complete bipartite graph
Complete bipartite graph,Discrete mathematics,Combinatorics,Edge-transitive graph,Signed graph,Line graph,Null graph,Semi-symmetric graph,Mathematics,Voltage graph,Complement graph
Journal
Volume
Issue
ISSN
232
1-3
Discrete Mathematics
Citations 
PageRank 
References 
2
0.41
0
Authors
1
Name
Order
Citations
PageRank
T. Zaslavsky129756.67