Your selections:

Show More

Show Less

A lower bound on the order of regular graphs with given girth pair

- Balbuena, Camino, Jiang, T., Lin, Yuqing, Marcote, Xavier, Miller, Mirka

**Authors:**Balbuena, Camino , Jiang, T. , Lin, Yuqing , Marcote, Xavier , Miller, Mirka**Date:**2007**Type:**Text , Journal article**Relation:**Journal of Graph Theory Vol. 55, no. 2 (2007), p. 153-163**Full Text:**false**Reviewed:****Description:**The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existence of regular graphs with given degree and girth pair was proved by Harary and Kovács [Regular graphs with given girth pair, J Graph Theory 7 (1983), 209-218]. A (**Description:**C1**Description:**2003004727

- Balbuena, Camino, Barker, Ewan, Lin, Yuqing, Miller, Mirka, Sugeng, Kiki Ariyanti

**Authors:**Balbuena, Camino , Barker, Ewan , Lin, Yuqing , Miller, Mirka , Sugeng, Kiki Ariyanti**Date:**2006**Type:**Text , Journal article**Relation:**Discrete Mathematics Vol. 306, no. 16 (2006), p. 1817-1829**Full Text:**false**Reviewed:****Description:**Let G be a graph of order n and size e. A vertex-magic total labeling is an assignment of the integers 1, 2, ..., n + e to the vertices and the edges of G, so that at each vertex, the vertex label and the labels on the edges incident at that vertex, add to a fixed constant, called the magic number of G. Such a labeling is a-vertex consecutive magic if the set of the labels of the vertices is { a + 1, a + 2, ..., a + n }, and is b-edge consecutive magic if the set of labels of the edges is { b + 1, b + 2, ..., b + e }. In this paper we prove that if an a-vertex consecutive magic graph has isolated vertices then the order and the size satisfy (n - 1)**Description:**C1**Description:**2003001604

All (k;g)-cages are k-edge-connected

- Lin, Yuqing, Miller, Mirka, Rodger, Chris

**Authors:**Lin, Yuqing , Miller, Mirka , Rodger, Chris**Date:**2005**Type:**Text , Journal article**Relation:**Journal of Graph Theory Vol. 48, no. 3 (2005), p. 219-227**Full Text:**false**Reviewed:****Description:**A (k;g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In this paper, we prove that (k;g)-cages are k-edge-connected if g is even. Earlier, Wang, Xu, and Wang proved that (k;g)-cages are k-edge-connected if g is odd. Combining our results, we conclude that the (k;g)-cages are k-edge-connected. © 2005 wiley Periodicals, Inc.**Description:**C1

Complete characterization of almost moore digraphs of degree three

- Baskoro, Edy, Miller, Mirka, Siran, Jozef, Sutton, Martin

**Authors:**Baskoro, Edy , Miller, Mirka , Siran, Jozef , Sutton, Martin**Date:**2005**Type:**Text , Journal article**Relation:**Journal of Graph Theory Vol. 48, no. 2 (2005), p. 112-126**Full Text:**false**Reviewed:****Description:**It is well known that Moore digraphs do not exist except for trivial cases (degree 1 or diameter 1), but there are digraphs of diameter two and arbitrary degree which miss the Moore bound by one. No examples of such digraphs of diameter at least three are known, although several necessary conditions for their existence have been obtained. In this paper, we prove that digraphs of degree three and diameter k ≥ 3 which miss the Moore bound by one do not exist. © 2004 Wiley Periodicals, Inc.**Description:**C1**Description:**2003000904

- «
- ‹
- 1
- ›
- »

Are you sure you would like to clear your session, including search history and login status?