eng
Azarbaijan Shahid Madani University
Communications in Combinatorics and Optimization
2538-2128
2538-2136
2016-06-30
1
1
1
13
10.22049/cco.2016.13514
13514
Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
L. Volkmann
volkm@math2.rwth-aachen.de
1
RWTH Aachen University
Let <em>D </em>be a digraph with vertex set <em>V(D)</em> .For vertex <em>v</em> <em>V(D)</em>, the degree of <em>v</em>, denoted by <em>d(v)</em>, is defined as the minimum value if its out-degree and its in-degree . Now let <em>D</em> 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.
http://comb-opt.azaruniv.ac.ir/article_13514_2c29013911bbc87b1dc4be81c6823349.pdf
Digraphs
edge-connectivity
Maximally edge-connected digraphs
Zeroth-order general Randic index
eng
Azarbaijan Shahid Madani University
Communications in Combinatorics and Optimization
2538-2128
2538-2136
2016-06-01
1
1
15
28
10.22049/cco.2016.13534
13534
The minus k-domination numbers in graphs
N. Dehgardi
ndehgardi@gmail.com
1
Sirjan University of Technology, Sirjan 78137, Iran
For any integer , a minus <em>k</em>-dominating function is afunction f : V (G) {-1,0, 1} satisfying w) for every vertex v, where <em>N(v) ={u </em> <em>V(G) | uv </em> <em> E(G)}</em> and N[v] =N(v)cup {v}. The minimum of the values of v), taken over all minus<em>k</em>-dominating functions <em>f</em>, is called the minus <em>k-</em>dominationnumber and is denoted by $gamma_k^-(G)$ . In this paper, we introduce the study of minus <em>k</em>-domination in graphs and we present several sharp lower bounds on the minus <em>k</em>-domination number for general graphs.
http://comb-opt.azaruniv.ac.ir/article_13534_842d7e5cc29617870d3b17a192a370e4.pdf
Minus $k$-dominating function
minus $k$-domination number
graph
eng
Azarbaijan Shahid Madani University
Communications in Combinatorics and Optimization
2538-2128
2538-2136
2016-06-01
1
1
29
41
10.22049/cco.2016.13543
13543
New bounds on proximity and remoteness in graphs
P. Dankelmann
pdankelmann@uj.ac.za
1
University of Johannesburg
The average distance of a vertex $v$ of a connected graph $G$<br />is the arithmetic mean of the distances from $v$ to all<br />other vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$<br />of $G$ are defined as the minimum and maximum average<br />distance of the vertices of $G$. <br />In this paper we investigate the difference between proximity or remoteness and the classical distance<br />parameters diameter and radius. <br />Among other results we show that in a graph of order<br />$n$ and minimum degree $delta$ the difference between<br />diameter and proximity and the difference between<br />radius and proximity cannot exceed <br />$frac{9n}{4(delta+1)}+c_1$ and <br />$frac{3n}{4(delta+1)}+c_2$, respectively, for <br />constants $c_1$ and $c_2$ which depend on $delta$<br />but not on $n$. These bounds improve bounds by<br />Aouchiche and Hansen cite{AouHan2011} in terms of<br />order alone by about a factor of $frac{3}{delta+1}$. <br />We further give lower bounds on the remoteness in<br />terms of diameter or radius. Finally we show that<br />the average distance of a graph, i.e., the average of<br />the distances between all pairs of vertices, cannot<br />exceed twice the proximity.
http://comb-opt.azaruniv.ac.ir/article_13543_99e338e777d53b2fb451bb25a4de0578.pdf
diameter
radius
proximity
remoteness
distance
eng
Azarbaijan Shahid Madani University
Communications in Combinatorics and Optimization
2538-2128
2538-2136
2016-08-08
1
1
43
56
10.22049/cco.2016.13544
13544
The convex domination subdivision number of a graph
M. Dettlaff
mdettlaff@mif.pg.gda.pl
1
S. Kosari
2
M. Lemańska
magda@mif.pg.gda.pl
3
S.M. Sheikholeslami
s.m.sheikholeslami@azaruniv.edu
4
Gdańsk University of Technology
Azarbaijan Shahid Madani University
Gdańsk University of Technology
Azarbaijan Shahid Madani University
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is a<br />dominating set of $G$ if every vertex in $Vsetminus D$ has at<br />least one neighbor in $D$. The distance $d_G(u,v)$ between two<br />vertices $u$ and $v$ is the length of a shortest $(u,v)$-path in<br />$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an<br />$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ if<br />vertices from all $(a, b)$-geodesics belong to $X$ for any two<br />vertices $a,bin X$. A set $X$ is a convex dominating set if it is<br />convex and dominating set. The {em convex domination number}<br />$gamma_{rm con}(G)$ of a graph $G$ equals the minimum<br />cardinality of a convex dominating set in $G$. {em The convex<br />domination subdivision number} sd$_{gamma_{rm con}}(G)$ is the<br />minimum number of edges that must be subdivided (each edge in $G$<br />can be subdivided at most once) in order to increase the convex<br />domination number. In this paper we initiate the study of convex<br />domination subdivision number and we establish upper bounds for<br />it.
http://comb-opt.azaruniv.ac.ir/article_13544_b044108d0b0eedf90a89cf1f47c4f8e0.pdf
convex dominating set
convex domination number
convex domination subdivision number
eng
Azarbaijan Shahid Madani University
Communications in Combinatorics and Optimization
2538-2128
2538-2136
2016-08-10
1
1
57
73
10.22049/cco.2016.13545
13545
More skew-equienergetic digraphs
Ch. Adiga
c_adiga@hotmail.com
1
Rakshith B R
ranmsc08@yahoo.co.in
2
University of Mysore
University of Mysore
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 <em>n</em> vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
http://comb-opt.azaruniv.ac.ir/article_13545_0f42ad1856ecb7c77844ab63bd68ed35.pdf
energy of a graph
skew energy of a digraph
equienergetic graphs
skew-equienergetic digraphs
eng
Azarbaijan Shahid Madani University
Communications in Combinatorics and Optimization
2538-2128
2538-2136
2016-06-01
1
1
75
82
10.22049/cco.2016.13556
13556
Bounds on the restrained Roman domination number of a graph
H. Abdollahzadeh Ahangar
ha.ahangar@yahoo.com
1
S.R. Mirmehdipour
r.m.mehdipor@gmail.com
2
Babol Noshirvani University of Technology
Babol Noshirvani University of Technology
A {em Roman dominating function} on a graph $G$ is a function<br />$f:V(G)rightarrow {0,1,2}$ satisfying the condition that every<br />vertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex<br />$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}<br />function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 induce<br />a subgraph with no isolated vertex.} The weight of a restrained Roman dominating function is<br />the value $omega(f)=sum_{uin V(G)} f(u)$. The minimum weight of a<br />restrained Roman dominating function of $G$ is called the { em<br />restrained Roman domination number} of $G$ and denoted by $gamma_{rR}(G)$.<br />In this paper we establish some sharp bounds for this parameter.
http://comb-opt.azaruniv.ac.ir/article_13556_af7da9ddc41c8343edb4835aaab47c2c.pdf
Roman dominating function
Roman domination number
restrained Roman dominating function
restrained Roman domination number