a subset $s$ of vertices in a graph $g$ is called a geodetic set if every vertex not in $s$ lies on a shortest path between two vertices from $s$‎. ‎a subset $d$ of vertices in $g$ is called dominating set if every vertex not in $d$ has at least one neighbor in $d$‎. ‎a geodetic dominating set $s$ is both a geodetic and a dominating set‎. ‎the geodetic (domination‎, ‎geodetic domination) number...

let $p$ be a prime number and $n$ be a positive integer. the graph $g_p(n)$ is a graph with vertex set $[n]={1,2,ldots ,n}$, in which there is an arc from $u$ to $v$ if and only if $uneq v$ and $pnmid u+v$. in this paper it is shown that $g_p(n)$ is a perfect graph. in addition, an explicit formula for the chromatic number of such graph is given.

jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables‎. ‎in this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.

given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...