Record Details

Pseudo 2-factor isomorphic regular bipartite graphs

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Pseudo 2-factor isomorphic regular bipartite graphs
 
Creator ABREU, M
DIWAN, AJIT A
JACKSON, BILL
LABBATE, D
SHEEHAN, J
 
Subject graphs
characterization
circuits
partial
 
Description A graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-factor is the same for all 2-factors of G. We prove that there exist no pseudo 2-factor isomorphic k-regular bipartite graphs for k⩾4. We also propose a characterization for 3-edge-connected pseudo 2-factor isomorphic cubic bipartite graphs and obtain some partial results towards our conjecture.
 
Publisher Elsevier
 
Date 2009-05-08T02:35:48Z
2011-12-08T06:56:32Z
2011-12-26T13:01:52Z
2011-12-27T05:47:30Z
2009-05-08T02:35:48Z
2011-12-08T06:56:32Z
2011-12-26T13:01:52Z
2011-12-27T05:47:30Z
2008
 
Type Article
 
Identifier Journal of Combinatorial Theory, Series B 98(2), 432-442
0095-8956
10.1016/j.jctb.2007.08.006
http://hdl.handle.net/10054/1301
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1301
 
Language en