[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
login
Revision History for A112919 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of nonisomorphic connected bipartite H-graphs H(n:i,j;k,m) on 6n vertices (or nodes) for 1<=i,j,k,m<n/2.
(history; published version)
#10 by Michael De Vlieger at Wed May 22 15:14:49 EDT 2024
STATUS

reviewed

approved

#9 by Stefano Spezia at Wed May 22 13:43:31 EDT 2024
STATUS

proposed

reviewed

#8 by Stefano Spezia at Wed May 22 13:43:29 EDT 2024
STATUS

editing

proposed

#7 by Stefano Spezia at Wed May 22 13:43:26 EDT 2024
REFERENCES

I. Z. Bouwer, W. W. Chernoff, B. Monson , and Z. Starr (Editors), "Foster's Census", Charles Babbage Research Centre, Winnipeg, 1988.

STATUS

proposed

editing

#6 by Michel Marcus at Wed May 22 13:04:37 EDT 2024
STATUS

editing

proposed

#5 by Michel Marcus at Wed May 22 13:04:30 EDT 2024
REFERENCES

J. D. Horton and I. Z. Bouwer, Symmetric Y-graphs and H-graphs, J. Comb. Theory B 53 (1991) 114-129

LINKS

J. D. Horton and I. Z. Bouwer, <a href="https://doi.org/10.1016/0095-8956(91)90057-Q">Symmetric Y-graphs and H-graphs</a>, J. Comb. Theory B 53 (1991) 114-129.

KEYWORD

nonn,more

STATUS

approved

editing

#4 by Charles R Greathouse IV at Sat Oct 12 15:12:49 EDT 2013
AUTHOR

Marko Boben (Marko.Boben(AT)fmf.uni-lj.si), Tomaz Pisanski (_Tomaz. Pisanski(AT)fmf.uni-lj.si) _ and Arjana Zitnik (Arjana.Zitnik(AT)fmf.uni-lj.si), Oct 06 2005

Discussion
Sat Oct 12
15:12
OEIS Server: https://oeis.org/edit/global/2004
#3 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010
REFERENCES

I. Z. Bouwer, W. W. Chernoff, B. Monson and Z. Starr (Eds.Editors), "Foster's Census", Charles Babbage Research Centre, Winnipeg, 1988.

KEYWORD

nonn,new

nonn

#2 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
COMMENTS

An H-graph H(n:i,j;k,m) has 6n vertices arranged in six segments of n vertices. Let the vertices be v_{x,y} for x=0,1,2,3,4,5 and y in the integers modulo n. The edges are v_{0,y}v_{1,y}, v_{0,y}v_{2,y}, v_{0,y}v_{3,y}, v_{1,y}v_{4,y}, v_{1,y}v_{5,y} (inner edges), and v_{2,y}v_{2,y+i}, v_{3,y}v_{3,y+j}, v_{4,y}v_{3,y+k}, v_{5,y}v_{5,y+m} (outer edges) where y=0,1,...,n-1 and subscript addition is performed modulo n.

REFERENCES

I. Z. Bouwer, W. W. Chernoff, B. Monson, and Z. Starr (Eds.), "Foster's Census", Charles Babbage Research Centre, Winnipeg, 1988.

KEYWORD

nonn,new

nonn

#1 by N. J. A. Sloane at Tue Jan 24 03:00:00 EST 2006
NAME

Number of nonisomorphic connected bipartite H-graphs H(n:i,j;k,m) on 6n vertices (or nodes) for 1<=i,j,k,m<n/2.

DATA

0, 1, 0, 1, 0, 4, 0, 4, 0, 12, 0, 7, 0, 16, 0, 18, 0, 33, 0, 24, 0, 67, 0, 41, 0, 71, 0, 111

OFFSET

3,6

COMMENTS

An H-graph H(n:i,j;k,m) has 6n vertices arranged in six segments of n vertices. Let the vertices be v_{x,y} for x=0,1,2,3,4,5 and y in the integers modulo n. The edges are v_{0,y}v_{1,y}, v_{0,y}v_{2,y}, v_{0,y}v_{3,y}, v_{1,y}v_{4,y}, v_{1,y}v_{5,y} (inner edges), and v_{2,y}v_{2,y+i}, v_{3,y}v_{3,y+j}, v_{4,y}v_{3,y+k}, v_{5,y}v_{5,y+m} (outer edges) where y=0,1,...,n-1 and subscript addition is performed modulo n.

REFERENCES

J. D. Horton and I. Z. Bouwer, Symmetric Y-graphs and H-graphs, J. Comb. Theory B 53 (1991) 114-129

I. Z. Bouwer, W. W. Chernoff, B. Monson, and Z. Starr (Eds.), "Foster's Census", Charles Babbage Research Centre, Winnipeg, 1988.

EXAMPLE

The only connected symmetric bipartite H-graph is H(34:1,13;9,15) which is also listed in Foster's Census.

CROSSREFS
KEYWORD

nonn

AUTHOR

Marko Boben (Marko.Boben(AT)fmf.uni-lj.si), Tomaz Pisanski (Tomaz.Pisanski(AT)fmf.uni-lj.si) and Arjana Zitnik (Arjana.Zitnik(AT)fmf.uni-lj.si), Oct 06 2005

STATUS

approved