فهرست مطالب

  • Volume:1 Issue:1, 2016
  • تاریخ انتشار: 1395/01/21
  • تعداد عناوین: 6
|
  • L. Volkmann * Pages 1-13
    Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient conditions for digraphs to be maximally edge-connected in terms of the zeroth-order general Randic index, the order and the minimum degree when Using the associated digraph of a graph, we show that our results include some corresponding known results on graphs.
    Keywords: Digraphs, Edge-connectivity, Maximally edge-connected digraphs, Zeroth-order general Randic index
  • N. Dehgardi * Pages 15-28
    For any integer ‎, ‎a minus k-dominating function is a‎function f‎ : ‎V (G) {-1,0‎, ‎1} satisfying w) for every vertex v, ‎where N(v) ={u V(G) | uv E(G)} and N[v] =N(v)\cup {v}. ‎The minimum of ‎the values of v)‎, ‎taken over all minus‎k-dominating functions f,‎ is called the minus k-domination‎number and is denoted by $\gamma_k^-(G)$ ‎. ‎In this paper‎, ‎we ‎introduce the study of minus k-domination in graphs and we present‎ ‎several sharp lower bounds on the minus k-domination number for general graphs‎.
    Keywords: ‎Minus $k$-dominating function‎, ‎minus‎ $k$-domination number‎, graph
  • P. Dankelmann * Pages 29-41
    The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$ of $G$ are defined as the minimum and maximum average distance of the vertices of $G$. In this paper we investigate the difference between proximity or remoteness and the classical distance parameters diameter and radius. Among other results we show that in a graph of order $n$ and minimum degree $delta$ the difference between diameter and proximity and the difference between radius and proximity cannot exceed $frac{9n}{4(delta+1)}+c_1$ and $frac{3n}{4(delta+1)}+c_2$, respectively, for constants $c_1$ and $c_2$ which depend on $delta$ but not on $n$. These bounds improve bounds by Aouchiche and Hansen cite{AouHan2011} in terms of order alone by about a factor of $frac{3}{delta+1}$. We further give lower bounds on the remoteness in terms of diameter or radius. Finally we show that the average distance of a graph, i.e., the average of the distances between all pairs of vertices, cannot exceed twice the proximity.
    Keywords: diameter, radius, proximity, remoteness, distance
  • M. Dettlaff, S. Kosari, M. Lema?ska, S.M. Sheikholeslami * Pages 43-56
    Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is a dominating set of $G$ if every vertex in $Vsetminus D$ has at least one neighbor in $D$. The distance $d_G(u,v)$ between two vertices $u$ and $v$ is the length of a shortest $(u,v)$-path in $G$. An $(u,v)$-path of length $d_G(u,v)$ is called an $(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ if vertices from all $(a, b)$-geodesics belong to $X$ for any two vertices $a,bin X$. A set $X$ is a convex dominating set if it is convex and dominating set. The {em convex domination number} $gamma_{rm con}(G)$ of a graph $G$ equals the minimum cardinality of a convex dominating set in $G$. {em The convex domination subdivision number} sd$_{gamma_{rm con}}(G)$ is the minimum number of edges that must be subdivided (each edge in $G$ can be subdivided at most once) in order to increase the convex domination number. In this paper we initiate the study of convex domination subdivision number and we establish upper bounds for it.
    Keywords: convex dominating set, convex domination number, convex domination subdivision number
  • Ch. Adiga, Rakshith B R * Pages 57-73
    Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
    Keywords: energy of a graph, skew energy of a digraph, equienergetic graphs, skew-equienergetic digraphs
  • H. Abdollahzadeh Ahangar *, S.R. Mirmehdipour Pages 75-82
    A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex $v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating} function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 induce a subgraph with no isolated vertex.} The weight of a restrained Roman dominating function is the value $omega(f)=sum_{uin V(G)} f(u)$. The minimum weight of a restrained Roman dominating function of $G$ is called the { em restrained Roman domination number} of $G$ and denoted by $gamma_{rR}(G)$. In this paper we establish some sharp bounds for this parameter.
    Keywords: Roman dominating function, Roman domination number, restrained Roman dominating function, restrained Roman domination number