2018-02-20T09:25:32Z
http://jac.ut.ac.ir/?_action=export&rf=summon&issue=50
Journal of Algorithms and Computation
JAC
2776-2476
2776-2476
2017
49
1
Theta Graph Designs
Anthony D.
Forbes
Terry S.
Griggs
Tamsin J.
Forbes
We solve the design spectrum problem for all theta graphs with 10, 11, 12, 13, 14 and 15 edges.
Graph design
Graph decomposition
Theta graph
2017
06
01
1
16
http://jac.ut.ac.ir/pdf_397_0512bf59e0fecd0dc77de2de97c2c8c6.html
Journal of Algorithms and Computation
JAC
2776-2476
2776-2476
2017
49
1
Remainder Cordial Labeling of Graphs
R.
Ponraj
K.
Annathurai
R.
Kala
In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{f}(0) - e_f(1) right|leq 1$ where $e_{f}(0)$ and $e_{f}(1)$ respectively denote the number of edges labelled with even integers and odd integers. A graph $G$ with a remainder cordial labeling is called a remainder cordial graph. We investigate the remainder cordial behavior of path, cycle, star, bistar, crown, comb, wheel, complete bipartite $K_{2,n}$ graph. Finally we propose a conjecture on complete graph $K_{n}$.
vertex equitable labeling
vertex Path
Cycle
Star
Bistar
Crown
Comb
wheel
complete bipartite graph
complete graph graph
2017
06
01
17
30
http://jac.ut.ac.ir/pdf_399_9bf96b3c6575b2e98518384f18e0de66.html
Journal of Algorithms and Computation
JAC
2776-2476
2776-2476
2017
49
1
Asteroidal number for some product graphs
S.
ALAGU
R.
KALA
The notion of Asteroidal triples was introduced by Lekkerkerker and Boland [6]. D.G.Corneil and others [2], Ekkehard Kohler [3] further investigated asteroidal triples. Walter generalized the concept of asteroidal triples to asteroidal sets [8]. Further study was carried out by Haiko Muller [4]. In this paper we find asteroidal numbers for Direct product of cycles, Direct product of path and cycle, Strong product of paths and cycles and some more graphs.
vertex equitable labeling
Asteroidal number
asteroidal sets
independence number
cartesian product
2017
06
01
31
43
http://jac.ut.ac.ir/pdf_413_01beaa9142c979dd177ee0b4e047fdf0.html
Journal of Algorithms and Computation
JAC
2776-2476
2776-2476
2017
49
1
Edge-tenacity in Networks
Dara
Moazzami
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the "Tenacity" and "Edge-tenacity" of a graph. In this paper we present results on the tenacity and edge-tenacity, $T_e(G)$, a new invariant, for several classes of graphs. Basic properties and some bounds for edge-tenacity, $T_e(G)$, are developed. Edge-tenacity values for various classes of graphs are calculated and future work andconcluding remarks are summarized
Edge-tenacity
network vulnerability
2017
06
01
45
53
http://jac.ut.ac.ir/pdf_414_d39c785dea8c5952d0d192f44c767675.html
Journal of Algorithms and Computation
JAC
2776-2476
2776-2476
2017
49
1
Linear optimization on the intersection of two fuzzy relational inequalities defined with Yager family of t-norms
Amin
Ghodousian
Reza
Zarghani
In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Yager family of t-norms is considered as fuzzy composition. Yager family of t-norms is a parametric family of continuous nilpotent t-norms which is also one of the most frequently applied one. This family of t-norms is strictly increasing in its parameter and covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. The resolution of the feasible region of the problem is firstly investigated when it is defined with max-Yager composition. Based on some theoretical results, conditions are derived for determining the feasibility. Moreover, in order to simplify the problem, some procedures are presented. It is shown that a lower bound is always attainable for the optimal objective value. Also, it is proved that the optimal solution of the problem is always resulted from the unique maximum solution and a minimal solution of the feasible region. A method is proposed to generate random feasible max-Yager fuzzy relational inequalities and an algorithm is presented to solve the problem. Finally, an example is described to illustrate these algorithms
Fuzzy relation
fuzzy relational inequality
linear optimization
fuzzy compositions and t-norms
2017
06
01
55
82
http://jac.ut.ac.ir/pdf_415_efef0843919600ca87fd333cdebadf64.html