2013
44
1
1
81
1

Constructions of antimagic labelings for some families of regular graphs
https://jac.ut.ac.ir/article_7911.html
1
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
0

1
7


Martin
Baca
Department of Applied Mathematics and Informatics, Technical University, Kosice, Slovakia
Iran
martin.baca@tuke.sk


Mirka
Miller
School of Mathematical and Physical Sciences, University of Newcastle, Australia
Iran
mirka.miller2@newcastle.edu.au


Oudone
Phanalasy
School of Mathematical and Physical Sciences, University of Newcastle, Australia
Iran
oudone.phanalasy@gmail.com


Andrea
SemanicovaFenovcıkova
Department of Applied Mathematics and Informatics, Technical University, Kosice, Slovakia
Iran
andrea.fenovcikova@tuke.sk
antimagic labeling
regular graph
regular complete
multipartite graph
1

Vertex Equitable Labelings of Transformed Trees
https://jac.ut.ac.ir/article_7912.html
1
0

9
20


P.
Jeyanthi
Govindammal Aditanar College for Women Tiruchendur628 215, Tamil Nadu, India
Iran
jeyajeyanthi@rediffmail.com


A.
Maheswari
Department of Mathematics Kamaraj College of Engineering and Technology Virudhunagar 626001, Tamil Nadu, India.
Iran
bala nithin@yahoo.co.in
vertex equitable labeling
vertex equitable graph
1

kequitable mean labeling
https://jac.ut.ac.ir/article_7913.html
1
0

21
30


P.
Jeyanthi
Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur 628 215,India
Iran
jeyajeyanthi@rediffmail.com
mean labeling
equitable labeling
equitable mean labeling
1

Profiles of covering arrays of strength two
https://jac.ut.ac.ir/article_7914.html
1
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques can overcome these computational difficulties, but for strength two do not appear to yield a number of tests that is competitive with the fewest known.
0

31
59


Charles
Colbourn
Arizona State University, P.O. Box 878809, , Tempe, AZ 852878809, U.S.A. and State Key Laboratory of Software Development Environment,, Beihang University, Beijing 100191, China.
Iran
charles.colbourn@asu.edu


Jose
TorresJimenez
CINVESTAVTamaulipas, Information Technology Laboratory,, Km. 6 Carretera VictoriaMonterrey, 87276 Victoria Tamps., Mexico
Iran
jtj@cinvestav.mx
covering array
interaction testing
direct product
simulated annealing
1

Modelling Decision Problems Via Birkhoff Polyhedra
https://jac.ut.ac.ir/article_7915.html
1
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n1) permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours neither in a graph nor its complement and these sets are embedded into disjoint orthogonal spaces as the solution set of a compact formulation. An orthogonal projection of its solution set into the subspace spanned by the Birkhoff polytope is the convex hull of all tours neither in a graph nor its complement. It’s suggested that these techniques might be adaptable for application to linear programming models of network and path problems.
0

61
81


Stephen J.
Gismondi
Department of Mathematics & Statistics, University of Guelph, Guelph, ON, CA. N1G 2W1
Iran
gismondi@uoguelph.ca
Combinatorial optimization
linear programming