On non-polynomiality of XOR over Zn2
- Authors: Grosek, Otokar , Miller, Mirka , Ryan, Joe
- Date: 2004
- Type: Text , Journal article
- Relation: Tatra Mountains Mathematical Publications Vol. 29, no. (2004), p. 183-191
- Full Text: false
- Reviewed:
- Description: C1
- Description: 2003000905
Conjectures and open problems on face antimagic evaluations of graphs
- 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
Context-dependent security enforcement of statistical databases
- Authors: Ryan, Joe , Mishra, Vivek , Stranieri, Andrew , Miller, Mirka
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at the 4th WSEAS International Conference on Information Security, Communications and Computers, Tenerife, Spain, 16-18 December 2005, Tenerife, Spain : 16th December, 2005
- Full Text:
- Reviewed:
- Description: E1
- Description: 2003001390
Exclusive sum labeling of graphs
- Authors: Miller, Mirka , Patel, Deval , Ryan, Joe , Sugeng, Kiki Ariyanti , Slamin, , Tuga, Mauritsius
- Date: 2005
- Type: Text , Journal article
- Relation: The Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 55, no. (2005), p. 137-148
- Full Text: false
- Reviewed:
- Description: C1
- Description: 2003001402
Exclusive sum labelings of trees
- Authors: Miller, Mirka , Tuga, Mauritsius , Ryan, Joe , Ryjacek, Zdenek
- Date: 2005
- Type: Text , Journal article
- Relation: The Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 55, no. (2005), p. 109-121
- Full Text: false
- Reviewed:
- Description: The notions of
- Description: C1
- Description: 2003001406
Mode and antimode graphs
- Authors: Ryan, Joe , Marshall, Kim
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at the Sixteenth Australasian Workshop on Combinatorial Algorithms, Ballarat, Victoria : 18th - 21st September, 2005
- Full Text:
- Reviewed:
- Description: E1
- Description: 2003001389
Open problems in the construction of large directed graphs
- Authors: Dafik , Miller, Mirka , Ryan, Joe , Slamin,
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at the Sixteenth Australasian Workshop on Combinatorial Algorithms, Ballarat, Victoria : 18th - 21st September, 2005
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003001352
Proceedings of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005)
- Authors: Ryan, Joe , Manyem, Prabhu , Sugeng, Kiki Ariyanti , Miller, Mirka
- Date: 2005
- Type: Text , Conference proceedings
- Full Text: false
Characterization of eccentric digraphs
- Authors: Gimbert, Joan , Lopez, Nacho , Miller, Mirka , Ryan, Joe
- Date: 2006
- Type: Text , Journal article
- Relation: Discrete Mathematics Vol. 306, no. 2 (2006), p. 210-219
- Full Text: false
- Reviewed:
- Description: The eccentric digraph ED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being 'eccentric'; that is, there is an arc from u to v in ED(G) if and only if v is at maximum distance from u in G. A digraph G is said to be eccentric if there exists a digraph H such that G=ED(H). This paper is devoted to the study of the following two questions: what digraphs are eccentric and when the relation of being eccentric is symmetric. We present a characterization of eccentric digraphs, which in the undirected case says that a graph G is eccentric iff its complement graph G is either self-centered of radius two or it is the union of complete graphs. As a consequence, we obtain that all trees except those with diameter 3 are eccentric digraphs. We also determine when ED(G) is symmetric in the cases when G is a graph or a digraph that is not strongly connected. Crown Copyright © 2006 Published by Elsevier B.V. All rights reserved.
- Description: C1
- Description: 2003001601
Knowledge based regulation of statistical databases
- Authors: Mishra, Vivek , Stranieri, Andrew , Miller, Mirka , Ryan, Joe
- Date: 2006
- Type: Text , Journal article
- Relation: WSEAS Transactions on Information Science and Applications Vol. 3, no. 2 (2006), p. 239-244
- Full Text: false
- Reviewed:
- Description: A statistical database system is a system that contains information about individuals, companies or organisations that enables authorized users to retrieve aggregate statistics such as mean and count. The regulation of a statistical database involves limiting the use of the database so that no sequence of queries is sufficient to infer protected information about an individual. The database is said to be compromised when individual confidential information is obtained as a result of a statistical query. Devices to protect against compromise include adding noise to the data or restricting a query. While effective, these techniques are sometimes too strong in that legitimate compromises for reasons of public safety are always blocked. Further, a statistical database can be often be compromised with some knowledge about the database attributes (working knowledge), the real world (supplementary knowledge) or the legal system (legal knowledge). In this paper we illustrate that a knowledge based system that represents working, supplementary and legal knowledge can contribute to the regulation of a statistical database.
- Description: C1
- Description: 2003001608
On the degrees of a strongly vertex-magic graph
- Authors: Balbuena, Camino , Barker, Ewan , Das, K. C. , Lin, Yuqing , Miller, Mirka , Ryan, Joe , Slamin, , Sugeng, Kiki Ariyanti , Tkac, M.
- Date: 2006
- Type: Text , Journal article
- Relation: Discrete Mathematics Vol. 306, no. 6 (2006), p. 539-551
- Full Text: false
- Reviewed:
- Description: Let G=(V,E) be a finite graph, where |V|=n≥2 and |E|=e≥1. A vertex-magic total labeling is a bijection λ from V∪E to the set of consecutive integers {1,2,...,n+e} with the property that for every v∈V, λ(v)+∑w∈N(v)λ(vw)=h for some constant h. Such a labeling is strong if λ(V)={1,2,...,n}. In this paper, we prove first that the minimum degree of a strongly vertex-magic graph is at least two. Next, we show that if 2e≥10n2-6n+1, then the minimum degree of a strongly vertex-magic graph is at least three. Further, we obtain upper and lower bounds of any vertex degree in terms of n and e. As a consequence we show that a strongly vertex-magic graph is maximally edge-connected and hamiltonian if the number of edges is large enough. Finally, we prove that semi-regular bipartite graphs are not strongly vertex-magic graphs, and we provide strongly vertex-magic total labeling of certain families of circulant graphs. © 2006 Elsevier B.V. All rights reserved
- Description: C1
- Description: 2003001603
Super edge-antimagicness for a class of disconnected graphs
- Authors: Dafik , Miller, Mirka , Ryan, Joe , Baca, Martin
- Date: 2006
- Type: Text , Conference paper
- Relation: Paper presented at AWOCA 2006, 17th Australasian Workshop on Combinatorial Algorithms, Uluru, Australia : 13th July, 2006 p. 67-75
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003001916
Survey of edge antimagic labelings of graphs
- 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
On irregular total labellings
- Authors: Baca, Martin , Jendrol, Stanislav , Miller, Mirka , Ryan, Joe
- Date: 2007
- Type: Text , Journal article
- Relation: Discrete Mathematics Vol. 307, no. 11-12 (May 2007), p. 1378-1388
- Full Text:
- Reviewed:
- Description: Two new graph characteristics, the total vertex irregularity strength and the total edge irregularity strength, are introduced. Estimations on these parameters are obtained. For some families of graphs the precise values of these parameters are proved. (c) 2006 Elsevier B.V. All rights reserved.
- Description: C1
- Description: 2003004909
On several classes of monographs
- Authors: Sugeng, Kiki Ariyanti , Ryan, Joe
- Date: 2007
- Type: Text , Journal article
- Relation: Australasian Journal of Combinatorics Vol. 37, no. (2007), p. 277-284
- Full Text: false
- Reviewed:
- Description: C1
- Description: 2003004943
A sum labelling for the generalised friendship graph
- Authors: Fernau, Henning , Ryan, Joe , Sugeng, Kiki Ariyanti
- Date: 2008
- Type: Text , Journal article
- Relation: Discrete Mathematics Vol. 308, no. 5-6 (2008), p. 734-740
- Full Text: false
- Reviewed:
- Description: We provide an optimal sum labelling scheme for the generalised friendship graph, also known as the flower (a symmetric collection of cycles meeting at a common vertex) and show that its sum number is 2. © 2007 Elsevier B.V. All rights reserved.
- Description: C1
Edge-antimagic total labeling of disjoint union of caterpillars
- Authors: Baca, Martin , Dafik , Miller, Mirka , Ryan, Joe
- Date: 2008
- Type: Text , Journal article
- Relation: Journal of combinatorial mathematics and combinatorial computing Vol. 65, no. (May 2008 2008), p. 61-70
- Full Text: false
- Reviewed:
On antimagic labelings of disjoint union of complete s-partite graphs
- Authors: Dafik , Miller, Mirka , Ryan, Joe , Baca, Martin
- Date: 2008
- Type: Text , Journal article
- Relation: Journal of combinatorial mathematics and combinatorial computing Vol. 65, no. (May 2008 2008), p. 41-49
- Full Text:
- Reviewed:
- Description: By an (a, d)-edge-antimagic total labeling of a graph G(V, E) we mean a bijective function f from V(G) u E(G) onto the set. { 1, 2, ... ,ǀV(C)ǀ+IE(G)I} such that the set of all the edge-weights, w(uv) ,.... f(u) + f(uv) + f(v), uv C E (G), is {a, a+ d, a+ 2d, . . . , a + (lE(G)I-1)d}, for two integers a > 0 and d
On antimode graphs
- Authors: Marshall, Kim , Ryan, Joe
- Date: 2008
- Type: Text , Journal article
- Relation: Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 65, no. (May 2008 2008), p. 51-60
- Full Text: false
- Reviewed:
- Description: The term mode graph was introduced by Boland, Kauffman and Panroug [2] to defiue a connected graph G such that, for every pair of vertices v, w in G, the number of vertices with eccentricity e(v) is equal to the number of vertices with eccentricity e(w). As a natural extension to this work, the concept of an antimode graph was introduced to describe a graph for which if e(v) ≠ e(w) then the number of vertices with eccentricity e(v) is not equal to the number of vertices with eccentricity e(w). ln this paper we determine the existence of some classes of antimode graphs, namely equisequential and (a, d)-antimode graphs.