243 search results - page 1 / 49 » On Balanced Graphs |
108
Voted
DM
2010
15 years 15 days ago
2010
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...
108
Voted
IPL
2010
14 years 9 months ago
2010
Polynomial algorithms are given for the following two problems:
119
Voted
ISPAN
2008
IEEE
15 years 6 months ago
2008
IEEE
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...
76
Voted
COMBINATORICS
2007
15 years 13 days ago
2007
Let G be a simple balanced bipartite graph on 2n vertices, δ = δ(G)/n, and ρ0 = δ+ √ 2δ−1 2 . If δ ≥ 1/2 then G has a ρ0n -regular spanning subgraph. The statement is...
109
Voted
JCT
2007
15 years 10 days ago
2007
A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every signed graph with no two vertex-disjoint negative circles and no balancing vertex...