103 hasil
Menampilkan 1–20 · 0,09 detik · RSS
Indonesian Journal of Combinatorics
SINTA 2
ISSN 2541-2205 · InaCombS; Universitas Jember; dan Universitas Indonesia · 103 artikel di indeks
-
Artikel Jurnal
Sum rules for permutations with fixed points involving Stirling numbers of the first kind
We propose sum rules for permutations pn(k) of the ensemble {1,2,...,n} with k fixed points, in the form of partial sums of their moments. The corresponding identities involve Stirling numbers of the first kind s(q,r). Using a formula due to Vassilev-Missana and the Schlomlich expression of…
-
Artikel Jurnal
The partition dimension of origami graphs and its barbell
The origami graph, On, n≥3, is a graph formed by a central cycle with origami folds, where each fold consists of two C3 cycles. The barbell origami graph, BOn for n≥3 is obtained by copying a On and connecting two graphs with a bridge. In this research, we determined the partition dimension of the…
-
Artikel Jurnal
Local edge antimagic chromatic number of join product of graphs
Let f : V(G) \to [1,|V(G)|] be a bijective mapping of the vertex set of a graph G to the integers 1 through |V(G)|. A labeling f is defined as a local edge antimagic labeling if, for any two adjacent edges uv and vx in E(G), their weights satisfy wf(uv) ≠ wf(vx), where the weight of an edge uv is…
-
Artikel Jurnal
On interior Roman domination in graphs
Let G = (V(G), E(G)) be a non-complete graph and let ϕ:V(G)→{0,1,2} be a function on G. For each i ∈ {0, 1, 2}, let Vi={w ∈ V(G): ϕ(w)=i}. A function ϕ=(V0, V1, V2) is an interior Roman dominating function (InRDF) on G if (i) for every v ∈ V0, there exists u ∈ V2 such that uv ∈ E(G), and (ii)…
-
Artikel Jurnal
Seidel spectrum for splitting V-vertex join and S-vertex join of graphs
Splitting V-vertex join and S-vertex join of graphs are the graph structures obtained from splitting graph of a graph. Present work concentrates on the study of Seidel spectrum for the vertex join structures considered.
-
Artikel Jurnal
Games of Nim with Dynamic Restrictions
The authors present formulas for the previous player’s winning positions of two variants of restricted Nim. In both of these two games, there is one pile of stones, and in the first variant, we investigate the case that in k-th turn, you can remove f(k) stones at most, where f is a function whose…
-
Artikel Jurnal
Outer multiset dimension of joined graphs
The outer multiset dimension of graph G, dimms(G), is the cardinality of the smallest subset S of vertices that uniquely recognizes each vertex outside S by using the multiset of distances between the vertex and the vertices in S. In 2023, Klavzar, Kuziak, and Yero proved that the only graphs with…
-
Artikel Jurnal
Local edge antimagic coloring for chain of path and cycle
Let G=(V,E) be a simple connected graph with vertex set V and edge set E. A local edge antimagic labeling of G is a bijection f:V (G)→{1, 2, 3, ... , |V(G)|} where the weights of any two adjacent edges of G are distinct. The weight of an edge uv is defined as w(uv) = f(u)+f(v). By assigning the…
-
Artikel Jurnal
The number of spanning trees of cyclic snakes
A cyclic snake is a connected graph formed by connecting, by means of vertex amalgamation, a certain number of copies of the cycle Cn, in such a way that the i-th copy of Cn is connected with the (i+1)-th copy, resulting in a graph with maximum degree 4. Spanning trees of this type of graph can be…
-
Artikel Jurnal
On Coloring of Fractional Powers of Star, Wheel, Friendship, and Fan Graphs
Let G be a simple, connected, and undirected graph. For m, n ∈ ℕ, the fractional power Gm/n = (G1/n)m of G is constructed by taking the n-subdivision of G (replacing each edge by a path of length n), and then raising the resulting graph to the m-th power (connecting any two distinct vertices with…
-
Artikel Jurnal
Γ-supermagic labeling of products of two cycles with dihedral groups
A Γ-supermagic labeling of a graph G=(V,E) is a bijection from E to a group Γ of order |E| such that for every vertex x∈V a product of labels of all edges incident with x is equal to the same element µ∈Γ. A Γ-supermagic labeling of the Cartesian product of two cycles, CmℹCn for every m,n≥3 of the…
-
Artikel Jurnal
Strong 3-Rainbow Indexes of Closed Helm Graphs
Let G be a nontrivial, edge-colored, and connected graph of order m≥3 where adjacent edges may have the same color. A tree T in graph G is called a rainbow tree if all the edges in T have different colors. For S⊆V(G), the Steiner distance sd(S) of S is the minimum size of a tree in G containing S…
-
Artikel Jurnal
Numbers of Weights of Convex Quadrilaterals in Weighted Point Sets
Let ℘n denote the family of sets of points in general position in the plane each of which is assigned a different number, called a weight, in {1,2,...,n}. For P∈℘n and a polygon Q with vertices in P, we define the weight of Q as the sum of the weights of its vertices and denote by Wk(P) the set of…
-
Artikel Jurnal
Locating Chromatic Number for Corona Operation of Path and Cycle
The locating chromatic number (lcn) of a graph is a part of discrete mathematic research, there is no general theorem for determining the lcn of any graph. The corona operation of Pn and Cm, denoted by Pn⊙Cm is defined as the graph obtained by taking one copy of Pn and |V(Pn)| copies of Cm and then…
-
Artikel Jurnal
On the generating graph of a finite group
In this paper, we study the generating graph for some finite groups which are semi-direct product ℤn ⋊ ℤm (direct product ℤn × ℤm) of cyclic groups ℤn and ℤm. We show that the generating graphs of them are regular (bi-regular, tri-regular) connected graph with diameter 2 and girth 3 if n and m are…
-
Artikel Jurnal
On Ramsey numbers for trees versus fans of even order
Given two graphs G and H. The graph Ramsey number R(G, H) is the least natural number r such that for every graph F on r vertices, either F contains a copy of G or F̅ contains a copy of H. A vertex v is called a dominating vertex in a graph G if it is adjacent to all other vertices of G. A wheel Wm…
-
Artikel Jurnal
When is the maximal graph of a non-quasi-local atomic domain connected?
In this paper, with any atomic domain R which admits at least two maximal ideals, we associate an undirected graph denoted by 𝕄𝔾𝕀(R) whose vertex set is I(R)={Rπ | π∈ Irr(R)\J(R)} (where Irr(R) is the set of all irreducible elements of R and J(R) is the Jacobson radical of R) and distinct Rπ, Rπ' ∈…
-
Artikel Jurnal
Local inclusive distance antimagic coloring of graphs
For a simple graph G, a bijection f : V(G) → [1,|V (G)|] is called as a local inclusive distance antimagic (LIDA) labeling of G if w(u) ≠ w(v) for every two adjacent vertices u,v ∈ V(G) with w(u) = ∑x∈N [u] f(x). A graph G is said to be local inclusive distance antimagic (LIDA) graph if it admits a…
-
Artikel Jurnal
Zonal Labeling of Graphs
A planar graph is said to be zonal when is possible to label its vertices with the nonzero elements of ℤ3, in such a way that the sum of the labels of the vertices on the boundary of each zone is 0 in ℤ3. In this work we present some conditions that guarantee the existence of a zonal labeling for a…
-
Artikel Jurnal
Family of Graphs with Partition Dimension Three
The characterization of all connected graphs of order n ≥3 with partition dimension 2, n−1 or n has been completely done. Additionally, all connected graphs of order n≥9 with partition dimension n−2 and graphs of order n≥11 with partition dimension n−3 have been characterized as well. However, the…