Your selections:

Show More

Show Less

Enumerations of vertex orders of almost Moore digraphs with selfrepeats

- Baskoro, Edy, Cholily, Yus Mochamad, Miller, Mirka

**Authors:**Baskoro, Edy , Cholily, Yus Mochamad , Miller, Mirka**Date:**2008**Type:**Text , Journal article**Relation:**Discrete Mathematics Vol. 308, no. 1 (2008), p. 123-128**Full Text:**false**Reviewed:****Description:**An almost Moore digraph G of degree d > 1, diameter k > 1 is a diregular digraph with the number of vertices one less than the Moore bound. If G is an almost Moore digraph, then for each vertex u ∈ V (G) there exists a vertex v ∈ V (G), called repeat of u and denoted by r (u) = v, such that there are two walks of length ≤ k from u to v. The smallest positive integer p such that the composition rp (u) = u is called the order of u. If the order of u is 1 then u is called a selfrepeat. It is known that if G is an almost Moore digraph of diameter k ≥ 3 then G contains exactly k selfrepeats or none. In this paper, we propose an exact formula for the number of all vertex orders in an almost Moore digraph G containing selfrepeats, based on the vertex orders of the out-neighbours of any selfrepeat vertex. © 2007 Elsevier B.V. All rights reserved.**Description:**C1

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

Statistical limit inferior and limit superior for sequences of fuzzy numbers

- Aytar, Salih, Mammadov, Musa, Pehlivan, Serpil

**Authors:**Aytar, Salih , Mammadov, Musa , Pehlivan, Serpil**Date:**2006**Type:**Text , Journal article**Relation:**Fuzzy Sets and Systems Vol. 157, no. 7 (2006), p. 976-985**Full Text:**false**Reviewed:****Description:**In this paper, we extend the concepts of statistical limit superior and limit inferior (as introduced by Fridy and Orhan [Statistical limit superior and limit inferior, Proc. Amer. Math. Soc. 125 (12) (1997) 3625-3631. [12]]) to statistically bounded sequences of fuzzy numbers and give some fuzzy-analogues of properties of statistical limit superior and limit inferior for sequences of real numbers. © 2005 Elsevier B.V. All rights reserved.**Description:**C1**Description:**2003001832

- 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

On the connectivity of (k, g)-cages of even girth

- Lin, Yuqing, Balbuena, Camino, Marcote, Xavier, Miller, Mirka

**Authors:**Lin, Yuqing , Balbuena, Camino , Marcote, Xavier , Miller, Mirka**Date:**2008**Type:**Text , Journal article**Relation:**Discrete Mathematics Vol. 308, no. 15 (2008), p. 3249-3256**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 give a brief overview of the current results on the connectivity of (k,g)-cages and we improve the current known best lower bound on the vertex connectivity of (k,g)-cages for g even. © 2007 Elsevier B.V. All rights reserved.**Description:**C1

- «
- ‹
- 1
- ›
- »

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