Biblio Discovery — Demo Discovery Service

67 hasil

Menampilkan 1–20 · 0,42 detik · RSS

Jurnal

Communications in Combinatorics and Optimization

Scopus

ISSN 2538-2128 · Azarbaijan Shahide Madani University · 67 artikel di indeks

  1. Artikel Jurnal Teks lengkap

    On coherent configuration of circular-arc graphs

    Fatemeh Raei Barandagh; Amir Rahnamai Barghi

    Communications in Combinatorics and Optimization, Vol. 10 No. 1 · 2025 · Inggris · DOAJ Scopus

    For any graph, Weisfeiler and Leman assigned the smallest matrix algebra which contains the adjacency matrix of the graph. The coherent configuration underlying this algebra for a graph $\Gamma$ is called the coherent configuration of $\Gamma$, denoted by $\mathcal{X}(\Gamma)$. In this paper, we…

  2. Artikel Jurnal Teks lengkap

    The topological ordering of covering nodes

    G.H. Shirdel; N. Kahkeshani

    Communications in Combinatorics and Optimization, Vol. 5 No. 1 · 2020 · Inggris · DOAJ Scopus

    The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological ordering algorithm on graphs…

  3. Artikel Jurnal Teks lengkap

    A study on some properties of leap graphs

    Ahmed M. Naji; B. Davvaz; Sultan S. Mahde dkk.

    Communications in Combinatorics and Optimization, Vol. 5 No. 1 · 2020 · Inggris · DOAJ Scopus

    In a graph G, the first and second degrees of a vertex v are equal to the number of their first and second neighbors and are denoted by d(v/G) and d2(v/G), respectively. The first, second and third leap Zagreb indices are the sum of squares of second degrees of vertices of G, the sum of products of…

  4. Artikel Jurnal Teks lengkap

    On relation between the Kirchhoff index and number of spanning trees of graph

    Igor Milovanovic; Edin Glogic; Marjan Matejic dkk.

    Communications in Combinatorics and Optimization, Vol. 5 No. 1 · 2020 · Inggris · DOAJ Scopus

    Let $G$ be a simple connected graph with degree sequence $(d_1,d_2,\ldots, d_n)$ where $\Delta =d_1\geq d_2\geq\cdots\geq d_n=\delta >0$ and let $\mu_1\geq \mu_2\geq\cdots\geq\mu_{n-1}>\mu_n=0$ be the Laplacian eigenvalues of $G$. Let $Kf(G)=n\sum_{i=1}^{n-1} \frac{1}{\mu_i}$ and $\tau(G)=\frac 1n…

  5. Artikel Jurnal Teks lengkap

    On strongly 2-multiplicative graphs

    D.D. Somashekara; H.E. Ravi; C.R. Veena

    Communications in Combinatorics and Optimization, Vol. 5 No. 5 · 2020 · Inggris · DOAJ Scopus

    A simple connected graph $G$ of order $n\ge 3$ is a strongly 2-multiplicative if there is an injective mapping $f :V(G)\rightarrow \{1,2,\ldots,n\}$ such that the induced mapping $h:\mathcal{A} \rightarrow \mathbb{Z}^+$ defined by $h(\mathcal{P})= \prod_{i=1}^{3} f({v_j}_i)$, where…

  6. Artikel Jurnal Teks lengkap

    On the Variance-Type Graph Irregularity Measures

    Tamas Reti; Ali Akbar

    Communications in Combinatorics and Optimization, Vol. 5 No. 2 · 2020 · Inggris · DOAJ Scopus

    Bell's degree-variance Var$\!{}_{B}$ for a graph $G$, with the degree sequence ($d_1,d_2,\ldots,d_n$) and size $m$, is defined as $Var\!_{B} (G)=\frac{1}{n} \sum _{i=1}^{n}\left[d_{i} -\frac{2m}{n}\right]^{2}$. In this paper, a new version of the irregularity measures of variance-type, denoted by…

  7. Artikel Jurnal Teks lengkap

    A note on the Roman domatic number of a digraph

    Lutz Volkmann; D. Meierling

    Communications in Combinatorics and Optimization, Vol. 5 No. 1 · 2020 · Inggris · DOAJ Scopus

    A {\em Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling $f\colon V(D)\to \{0, 1, 2\}$ such that every vertex with label $0$ has an in-neighbor with label $2$. A set $\{f_1,f_2,\ldots,f_d\}$ of Roman dominating functions on $D$ with the property that $\sum_{i=1}^d…

  8. Artikel Jurnal

    Nonnegative signed total Roman domination in graphs

    Nasrin Dehgardi; Lutz Volkmann

    Communications in Combinatorics and Optimization, Vol. 5 No. 2 · 2020 · Inggris · DOAJ Scopus

    Let $G$ be a finite and simple graph with vertex set $V(G)$. A nonnegative signed total Roman dominating function (NNSTRDF) on a graph $G$ is a function $f:V(G)\rightarrow\{-1, 1, 2\}$ satisfying the conditions that (i) $\sum_{x\in N(v)}f(x)\ge 0$ for each $v\in V(G)$, where $N(v)$ is the open…

  9. Artikel Jurnal Teks lengkap

    Outer-weakly convex domination number of graphs

    Jonecis A. Dayap; Richard T. Alcantara; Roma M. Anoos

    Communications in Combinatorics and Optimization, Vol. 5 No. 2 · 2020 · Inggris · DOAJ Scopus

    For a given simple graph $G=(V,E)$, a set $S\subseteq V$ is an outer-weakly convex dominating set if every vertex in $V\setminus S$ is adjacent to some vertex in $S$ and $V\setminus S$ is a weakly convex set. The \emph{outer-weakly convex domination number} of a graph $G$, denoted by…

  10. Artikel Jurnal

    New results on upper domatic number of graphs

    Libin Chacko Samuel; Mayamma Joseph

    Communications in Combinatorics and Optimization, Vol. 5 No. 2 · 2020 · Inggris · DOAJ Scopus

    For a graph G = (V, E), a partition π = {V1, V2, . . . , Vk} of the vertex set V is an upper domatic partition if Vi dominates Vj or Vj dominates Vi or both for every Vi, Vj ∈ π, whenever i 6= j. The upper domatic number D(G) is the maximum order of an upper domatic partition of G. We study the…

  11. Artikel Jurnal Teks lengkap

    Bounds on signed total double Roman domination

    L. Shahbazi; H. Abdollahzadeh Ahangar; R. Khoeilar dkk.

    Communications in Combinatorics and Optimization, Vol. 5 No. 2 · 2020 · Inggris · DOAJ Scopus

    A signed total double Roman dominating function (STDRDF) on {an} isolated-free graph $G=(V,E)$ is a function $f:V(G)\rightarrow\{-1,1,2,3\}$ such that (i) every vertex $v$ with $f(v)=-1$ has at least two neighbors assigned 2 under $f$ or one neighbor $w$ with $f(w)=3$, (ii) every vertex $v$ with…

  12. Artikel Jurnal Teks lengkap

    On the edge geodetic and edge geodetic domination numbers of a graph

    Vladimir Samodivkin

    Communications in Combinatorics and Optimization, Vol. 5 No. 1 · 2020 · Inggris · DOAJ Scopus

    In this paper, we study both concepts of geodetic dominating and edge geodetic dominating sets and derive some tight upper bounds on the edge geodetic and the edge geodetic domination numbers. We also obtain attainable upper bounds on the maximum number of elements in a partition of a vertex set of…

  13. Artikel Jurnal Teks lengkap

    Some new bounds on the general sum–connectivity index

    Akbar Ali; Mubeen Javaid; Marjan Matejic dkk.

    Communications in Combinatorics and Optimization, Vol. 5 No. 2 · 2020 · Inggris · DOAJ Scopus

    Let $G=(V,E)$ be a simple connected graph with $n$ vertices, $m$ edges and sequence of vertex degrees $d_1 \ge d_2 \ge \cdots \ge d_n>0$, $d_i=d(v_i)$, where $v_i\in V$. With $i\sim j$ we denote adjacency of vertices $v_i$ and $v_j$. The general sum--connectivity index of graph is defined as…

  14. Artikel Jurnal Teks lengkap

    On the super domination number of graphs

    Douglas J. Klein; Juan A. Rodrıguez-Velazquez; Eunjeong Yi

    Communications in Combinatorics and Optimization, Vol. 5 No. 2 · 2020 · Inggris · DOAJ Scopus

    The open neighborhood of a vertex v of a graph G is the set N(v) consisting of all vertices adjacent to v in G. For D ⊆ V (G), we define D = V (G) \ D. A set D ⊆ V (G) is called a super dominating set of G if for every vertex u ∈ D, there exists v ∈ D such that N(v) ∩ D = {u}. The super domination…

  15. Artikel Jurnal Teks lengkap

    Characterization of signed paths and cycles admitting minus dominating function

    S.R. Shreyas; M. Joseph

    Communications in Combinatorics and Optimization, Vol. 5 No. 1 · 2020 · Inggris · DOAJ Scopus

    Let $G=(V,E,\sigma)$ be a finite signed graph. A function $f: V \rightarrow\{-1,0,1\}$ is a minus dominating function (MDF) of $ G $ if $f(u)+\sum_{v \in N(u)} \sigma (uv)f(v)\geq 1 $ for all $ u\in V $. In this paper we characterize signed paths and cycles admitting an MDF.

  16. Artikel Jurnal Teks lengkap

    Total double Roman domination in graphs

    Guoliang Hao; Lutz Volkmann; Doost Ali Mojdeh

    Communications in Combinatorics and Optimization, Vol. 5 No. 1 · 2020 · Inggris · DOAJ Scopus

    Let $G$ be a simple graph with vertex set $V$. A double Roman dominating function (DRDF) on $G$ is a function $f:V\rightarrow\{0,1,2,3\}$ satisfying that if $f(v)=0$, then the vertex $v$ must be adjacent to at least two vertices assigned $2$ or one vertex assigned $3$ under $f$, whereas if…

  17. Artikel Jurnal Teks lengkap

    Total Roman domination subdivision number in graphs

    Jafar Amjad

    Communications in Combinatorics and Optimization, Vol. 5 No. 2 · 2020 · Inggris · DOAJ Scopus

    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$. A {\em total Roman dominating function} is a Roman dominating function with the…

  18. Artikel Jurnal Teks lengkap

    The 2-dimension of a Tree

    Jason T. Hedetniemi; Stephen T. Hedetniemi; Renu C. Laskar dkk.

    Communications in Combinatorics and Optimization, Vol. 5 No. 1 · 2020 · Inggris · DOAJ Scopus

    Let x and y be two distinct vertices in a connected graph G. The x, ylocation of a vertex w is the ordered pair of distances from w to x and y, that is, the ordered pair (d(x, w), d(y, w)). A set of vertices W in G is x, y-located if any two vertices in W have distinct x, y-locations. A set W of…

  19. Artikel Jurnal Teks lengkap

    Weak signed Roman domination in graphs

    Lutz Volkmann

    Communications in Combinatorics and Optimization, Vol. 5 No. 2 · 2020 · Inggris · DOAJ Scopus

    A weak signed Roman dominating function (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as a function $f:V(G)\rightarrow\{-1,1,2\}$ having the property that $\sum_{x\in N[v]}f(x)\ge 1$ for each $v\in V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRDF is the sum of…

  20. Artikel Jurnal Teks lengkap

    On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

    J. Tayyebi

    Communications in Combinatorics and Optimization, Vol. 4 No. 1 · 2019 · Inggris · DOAJ Scopus

    Given an undirected network $G(V,A,\mathbf{c})$ and a perfect matching $M$ of $G$, the inverse maximum perfect matching problem consists of modifying minimally the elements of $\mathbf{c}$ so that $M$ becomes a maximum perfect matching with respect to the modified vector. In this article, we…