Constructions of antimagic labelings for some families of regular graphs
Martin
Baca
Department of Applied Mathematics and Informatics, Technical University, Kosice, Slovakia
author
Mirka
Miller
School of Mathematical and Physical Sciences, University of Newcastle, Australia
author
Oudone
Phanalasy
School of Mathematical and Physical Sciences, University of Newcastle, Australia
author
Andrea
Semanicova-Fenovcıkova
Department of Applied Mathematics and Informatics, Technical University, Kosice, Slovakia
author
text
article
2013
eng
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.
Journal of Algorithms and Computation
University of Tehran
2476-2776
44
v.
1
no.
2013
1
7
https://jac.ut.ac.ir/article_7911_23116855595822c2b95842e7b3f1e0ea.pdf
Vertex Equitable Labelings of Transformed Trees
P.
Jeyanthi
Govindammal Aditanar College for Women Tiruchendur-628 215, Tamil Nadu, India
author
A.
Maheswari
Department of Mathematics Kamaraj College of Engineering and Technology Virudhunagar- 626-001, Tamil Nadu, India.
author
text
article
2013
eng
Journal of Algorithms and Computation
University of Tehran
2476-2776
44
v.
1
no.
2013
9
20
https://jac.ut.ac.ir/article_7912_b7a385d110f5ec4c2d805c82bcf3079e.pdf
k-equitable mean labeling
P.
Jeyanthi
Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur- 628 215,India
author
text
article
2013
eng
Journal of Algorithms and Computation
University of Tehran
2476-2776
44
v.
1
no.
2013
21
30
https://jac.ut.ac.ir/article_7913_c767d522b6867436b14ee92dc0600323.pdf
Profiles of covering arrays of strength two
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.
author
Jose
Torres-Jimenez
CINVESTAV-Tamaulipas, Information Technology Laboratory,, Km. 6 Carretera Victoria-Monterrey, 87276 Victoria Tamps., Mexico
author
text
article
2013
eng
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.
Journal of Algorithms and Computation
University of Tehran
2476-2776
44
v.
1
no.
2013
31
59
https://jac.ut.ac.ir/article_7914_15663cf03a41c7a363532a169150be93.pdf
Modelling Decision Problems Via Birkhoff Polyhedra
Stephen J.
Gismondi
Department of Mathematics & Statistics, University of Guelph, Guelph, ON, CA. N1G 2W1
author
text
article
2013
eng
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.
Journal of Algorithms and Computation
University of Tehran
2476-2776
44
v.
1
no.
2013
61
81
https://jac.ut.ac.ir/article_7915_3fb7c1065f20646ec7ca90750ff4a8c7.pdf