University of Tehran
Journal of Algorithms and Computation
2476-2776
2476-2784
44
1
2013
07
01
Constructions of antimagic labelings for some families of regular graphs
1
7
EN
Martin
Baca
Department of Applied Mathematics and Informatics, Technical University, Kosice, Slovakia
martin.baca@tuke.sk
Mirka
Miller
School of Mathematical and Physical Sciences, University of Newcastle, Australia
mirka.miller2@newcastle.edu.au
Oudone
Phanalasy
School of Mathematical and Physical Sciences, University of Newcastle, Australia
oudone.phanalasy@gmail.com
Andrea
Semanicova-Fenovcıkova
Department of Applied Mathematics and Informatics, Technical University, Kosice, Slovakia
andrea.fenovcikova@tuke.sk
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.
antimagic labeling,regular graph,regular complete,multipartite graph
https://jac.ut.ac.ir/article_7911.html
https://jac.ut.ac.ir/article_7911_23116855595822c2b95842e7b3f1e0ea.pdf
University of Tehran
Journal of Algorithms and Computation
2476-2776
2476-2784
44
1
2013
07
01
Vertex Equitable Labelings of Transformed Trees
9
20
EN
P.
Jeyanthi
Govindammal Aditanar College for Women Tiruchendur-628 215, Tamil Nadu, India
jeyajeyanthi@rediffmail.com
A.
Maheswari
Department of Mathematics Kamaraj College of Engineering and Technology Virudhunagar- 626-001, Tamil Nadu, India.
bala nithin@yahoo.co.in
vertex equitable labeling,vertex equitable graph
https://jac.ut.ac.ir/article_7912.html
https://jac.ut.ac.ir/article_7912_b7a385d110f5ec4c2d805c82bcf3079e.pdf
University of Tehran
Journal of Algorithms and Computation
2476-2776
2476-2784
44
1
2013
07
01
k-equitable mean labeling
21
30
EN
P.
Jeyanthi
Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur- 628 215,India
jeyajeyanthi@rediffmail.com
mean labeling,equitable labeling,equitable mean labeling
https://jac.ut.ac.ir/article_7913.html
https://jac.ut.ac.ir/article_7913_c767d522b6867436b14ee92dc0600323.pdf
University of Tehran
Journal of Algorithms and Computation
2476-2776
2476-2784
44
1
2013
12
01
Profiles of covering arrays of strength two
31
59
EN
Charles
Colbourn
Arizona State University, P.O. Box 878809, , Tempe, AZ 85287-8809, U.S.A. and State Key Laboratory of Software Development Environment,, Beihang University, Beijing 100191, China.
charles.colbourn@asu.edu
Jose
Torres-Jimenez
CINVESTAV-Tamaulipas, Information Technology Laboratory,, Km. 6 Carretera Victoria-Monterrey, 87276 Victoria Tamps., Mexico
jtj@cinvestav.mx
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.
covering array,interaction testing,direct product,simulated annealing
https://jac.ut.ac.ir/article_7914.html
https://jac.ut.ac.ir/article_7914_15663cf03a41c7a363532a169150be93.pdf
University of Tehran
Journal of Algorithms and Computation
2476-2776
2476-2784
44
1
2013
11
01
Modelling Decision Problems Via Birkhoff Polyhedra
61
81
EN
Stephen J.
Gismondi
Department of Mathematics & Statistics, University of Guelph, Guelph, ON, CA. N1G 2W1
gismondi@uoguelph.ca
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 (n-1)- 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.
Combinatorial optimization,linear programming
https://jac.ut.ac.ir/article_7915.html
https://jac.ut.ac.ir/article_7915_3fb7c1065f20646ec7ca90750ff4a8c7.pdf