Your selections:

Show More

Show Less

On the structure of (d,3)-digraphs containing selfrepeats

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

**Authors:**Baskoro, Edy , Cholily, Yus Mochamad , Miller, Mirka**Date:**2004**Type:**Text , Conference paper**Relation:**Paper presented at AWOCA 2004: Fifteenth Australasian Workshop on Combinatorial Algorithms, Ballina, New South Wales : 6-9th July, 2004**Full Text:**false**Reviewed:****Description:**E1**Description:**2003000901

Conjectures and open problems on face antimagic evaluations of graphs

- Miller, Mirka, Baca, Martin, Baskoro, Edy, Cholily, Yus Mochamad, Jendrol, Stanislav, Lin, Yuqing, Ryan, Joe, Simanjuntak, Rinovia, Slamin,, Sugeng, Kiki Ariyanti

**Authors:**Miller, Mirka , Baca, Martin , Baskoro, Edy , Cholily, Yus Mochamad , Jendrol, Stanislav , Lin, Yuqing , Ryan, Joe , Simanjuntak, Rinovia , Slamin, , Sugeng, Kiki Ariyanti**Date:**2005**Type:**Text , Journal article**Relation:**Journal of Indonesian Mathematical Society MIHMI Vol. 11, no. 2 (2005), p. 175-192**Full Text:**false**Reviewed:****Description:**C1**Description:**2003001408

Super edge-antimagic labelings of the generalized Petersen graph P(n, (n-1)/2))

- Baca, Martin, Baskoro, Edy, Simanjuntak, Rinovia, Sugeng, Kiki Ariyanti

**Authors:**Baca, Martin , Baskoro, Edy , Simanjuntak, Rinovia , Sugeng, Kiki Ariyanti**Date:**2006**Type:**Text , Journal article**Relation:**Utilitas Mathematica Vol. 70, no. (Jul 2006), p. 119-127**Full Text:**false**Reviewed:****Description:**An (a,d)-edge-antimagic total labeling of G is a one-to-one mapping f taking the vertices and edges onto 1, 2,..., vertical bar V (G)vertical bar + vertical bar E(G)vertical bar so that the edge-weights w(xy) = f(x) + f(y) + f(xy), xy is an element of E(G), form an arithmetic progression with initial term a and common difference d. An (a, d)-edge-antimagic total labeling is called super (a,d)-edge-antimagic total if f(V(G)) = {1, 2,..., vertical bar V(G)vertical bar}. This paper considers such labelings applied to cycles and generalized Petersen graphs.**Description:**C1**Description:**2003001832

Survey of edge antimagic labelings of graphs

- Miller, Mirka, Baca, Martin, Baskoro, Edy, Ryan, Joe, Simanjuntak, Rinovia, Sugeng, Kiki Ariyanti

**Authors:**Miller, Mirka , Baca, Martin , Baskoro, Edy , Ryan, Joe , Simanjuntak, Rinovia , Sugeng, Kiki Ariyanti**Date:**2006**Type:**Text , Journal article**Relation:**Journal of Indonesian Mathematical Society, MIHMI Vol. 12, no. 1 (2006), p. 113-130**Full Text:**false**Reviewed:****Description:**C1**Description:**2003001600

Structure of repeat cycles in almost Moore digraphs with selfrepeats and diameter 3

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

**Authors:**Miller, Mirka , Baskoro, Edy , Cholily, Yus Mochamad**Date:**2006**Type:**Text , Journal article**Relation:**Bulletin of the Institute of Combinatorics and its Applications Vol. 46, no. (2006), p. 99-109**Full Text:**false**Reviewed:****Description:**C1**Description:**2003001829

Antimagic valuations for the special class of plane graphs

- Baca, Martin, Baskoro, Edy, Miller, Mirka

**Authors:**Baca, Martin , Baskoro, Edy , Miller, Mirka**Date:**2005**Type:**Text , Journal article**Relation:**Lecture Notes in Computer Science Vol. 3350, no. (2005), p. 58-64**Full Text:**false**Reviewed:****Description:**We deal with the problem of labeling the vertices, edges and faces of a special class of plane graphs with 3-sided internal faces in such a way that the label of a face and the labels of the vertices and edges surrounding that face all together add up to the weight of that face. These face weights then form an arithmetic progression with common difference d.**Description:**C1**Description:**2003001410

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

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?