Constructions of antimagic labelings for some families of regular graphs
University of Tehran
Journal of Algorithms and Computation
2776-2476
2476-2784
2013
07
44
1
No
2013-07-01
Martin Baca,Mirka Miller,Oudone Phanalasy,Andrea Semanicova-Fenovcıkova
Department of Applied Mathematics and Informatics, Technical University, Kosice, Slovakia,School of Mathematical and Physical Sciences, University of Newcastle, Australia,School of Mathematical and Physical Sciences, University of Newcastle, Australia,Department of Applied Mathematics and Informatics, Technical University, Kosice, Slovakia
1
antimagic labeling,regular graph,regular complete,multipartite graph
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.
http://jac.ut.ac.ir/article_345_39.html
http://jac.ut.ac.ir/pdf_345_23116855595822c2b95842e7b3f1e0ea.html
Vertex Equitable Labelings of Transformed Trees
University of Tehran
Journal of Algorithms and Computation
2776-2476
2476-2784
2013
07
44
1
No
2013-07-01
P. Jeyanthi,A. Maheswari
Govindammal Aditanar College for Women Tiruchendur-628 215, Tamil Nadu, India,Department of Mathematics Kamaraj College of Engineering and Technology Virudhunagar- 626-001, Tamil Nadu, India.
9
vertex equitable labeling,vertex equitable graph
http://jac.ut.ac.ir/article_346_39.html
http://jac.ut.ac.ir/pdf_346_b7a385d110f5ec4c2d805c82bcf3079e.html
k-equitable mean labeling
University of Tehran
Journal of Algorithms and Computation
2776-2476
2476-2784
2013
07
44
1
No
2013-07-01
P. Jeyanthi
Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur- 628 215,India
21
mean labeling,equitable labeling,equitable mean labeling
http://jac.ut.ac.ir/article_347_39.html
http://jac.ut.ac.ir/pdf_347_c767d522b6867436b14ee92dc0600323.html
Profiles of covering arrays of strength two
University of Tehran
Journal of Algorithms and Computation
2776-2476
2476-2784
2013
12
44
1
No
2013-12-01
Charles Colbourn,Jose Torres-Jimenez
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.,CINVESTAV-Tamaulipas, Information Technology Laboratory,, Km. 6 Carretera Victoria-Monterrey, 87276 Victoria Tamps., Mexico
31
covering array,interaction testing,direct product,simulated annealing
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.
http://jac.ut.ac.ir/article_348_39.html
http://jac.ut.ac.ir/pdf_348_15663cf03a41c7a363532a169150be93.html
Modelling Decision Problems Via Birkhoff Polyhedra
University of Tehran
Journal of Algorithms and Computation
2776-2476
2476-2784
2013
11
44
1
No
2013-11-01
Stephen J. Gismondi
Department of Mathematics & Statistics, University of Guelph, Guelph, ON, CA. N1G 2W1
61
Combinatorial optimization,linear programming
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.
http://jac.ut.ac.ir/article_349_39.html
http://jac.ut.ac.ir/pdf_349_3fb7c1065f20646ec7ca90750ff4a8c7.html