Sciweavers

677 search results - page 5 / 136
» Bipartite roots of graphs
Sort
View
EJC
2007
13 years 7 months ago
A new family of locally 5-arc transitive graphs
We present a new family of locally 5–arc transitive graphs. The graphs constructed are bipartite with valency {2m + 1, 2m}. The actions of the automorphism group on the two bipa...
Michael Giudici, Cai Heng Li, Cheryl E. Praeger
ICPR
2010
IEEE
13 years 10 months ago
Cell Tracking in Video Microscopy Using Bipartite Graph Matching
Automated visual tracking of cells from video microscopy has many important biomedical applications. In this paper, we model the problem of cell tracking over pairs of video micro...
Ananda Chowdhury, Rohit Chatterjee, Mayukh Ghosh, ...
IPCO
1998
125views Optimization» more  IPCO 1998»
13 years 8 months ago
A Characterization of Weakly Bipartite Graphs
We give a proof of Guenin's theorem characterizing weakly bipartite graphs by not having an odd-K5 minor. The proof curtails the technical and case-checking parts of Guenin�...
Bertrand Guenin
COMBINATORICS
2007
74views more  COMBINATORICS 2007»
13 years 7 months ago
Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree
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...
Béla Csaba
APPML
2005
80views more  APPML 2005»
13 years 7 months ago
On the pseudo-inverse of the Laplacian of a bipartite graph
1 We provide an efficient method to calculate the pseudo-inverse of the Laplacian of a bipartite graph, which is2 based on the pseudo-inverse of the normalized Laplacian.3
Ngoc-Diep Ho, Paul Van Dooren