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