Search Results - "Wijaya, Kristiana"

An Inclusive Distance Irregularity Strength of n-ary Tree by Wijaya, Kristiana, Aulia, Safira Nur, Halikin, Ikhsanul, Kusbudiono, Kusbudiono

“…An inclusive distance vertex irregular labelling of a simple graph G is a function of the vertex set of  to positive integer set such that the sum of…”
Get full text

Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4) by Sarasvati, Sabrina Shena, Halikin, Ikhsanul, Wijaya, Kristiana

“…A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by…”
Get full text

Another Antimagic Conjecture by Simanjuntak, Rinovia, Nadeak, Tamaro, Yasin, Fuad, Wijaya, Kristiana, Hinding, Nurdin, Sugeng, Kiki Ariyanti

“…An antimagic labeling of a graph G is a bijection f:E(G)→{1,…,|E(G)|} such that the weights w(x)=∑y∼xf(y) distinguish all vertices. A well-known conjecture of…”
Get full text

Local Super Antimagic Total Labeling for Vertex Coloring of Graphs by Slamin, Slamin, Adiwijaya, Nelly Oktavia, Hasan, Muhammad Ali, Dafik, Dafik, Wijaya, Kristiana

“…Let G=(V,E) be a graph with vertex set V and edge set E. A local antimagic total vertex coloring f of a graph G with vertex-set V and edge-set E is an…”
Get full text

Distance irregularity strength of graphs with pendant vertices by Susanto, Faisal, Wijaya, Kristiana, Slamin, Semani ov -Fe ov kov, Andrea

“…A vertex \(k\)-labeling \(\phi:V(G)\rightarrow\{1,2,\dots,k\}\) on a simple graph \(G\) is said to be a distance irregular vertex \(k\)-labeling of \(G\) if…”
Get full text

Non-inclusive and inclusive distance irregularity strength for the join product of graphs by Susanto, Faisal, Wijaya, Kristiana, Sudarsana, I Wayan, Slamin, Slamin

“…A function  ϕ: V(G)→{1, 2, …, k}  of a simple graph  G  is said to be a non-inclusive distance vertex irregular  k -labeling of  G  if the sums of labels of…”
Get full text

Subdivision of graphs in R(mK2,P4) by Wijaya, Kristiana, Baskoro, Edy Tri, Assiyatun, Hilda, Suprijanto, Djoko

“…For any graphs F,G, and H, the notation F→(G,H) means that any red-blue coloring of all edges of F will contain either a red copy of G or a blue copy of H. The…”
Get full text

DIMENSI METRIK DARI GRAF HASIL IDENTIFIKASI by Kristiana Wijaya

“…Pada paper ini dibahas mengenai dimensi metrik dari graf hasil identififikasi. Dimensi metrik dari sebuah graf G, dinotasikan dengan dim(G), adalah…”
Get full text

On Ramsey -minimal graphs by Wijaya, Kristiana, Baskoro, Edy Tri, Assiyatun, Hilda, Suprijanto, Djoko

“…Let and be simple graphs. We write to mean that any red-blue coloring of all edges of will contain either a red copy of or a blue copy of A graph (without…”
Get full text

The Complete List of Ramsey (2K2,K4)-Minimal Graphs by Wijaya, Kristiana, Baskoro, Edy Tri, Assiyatun, Hilda, Suprijanto, Djoko

“…Let $F, G,$ and $H$ be non-empty graphs. The notation $F \rightarrow (G,H)$ means that if all edges of $F$ are arbitrarily colored by red or blue, then either…”
Get full text

On Distance Irregular Labeling of Disconnected Graphs by SUSANTO, FAISAL, WIJAYA, KRISTIANA, PURNAMA, PRASANTI MIA, S, SLAMIN

“…A distance irregular k-labeling of a graph G is a function f : V (G) → {1, 2, . . . , k} such that the weights of all vertices are distinct. The weight of a…”
Get full text

On Ramsey (mK2,H)-Minimal Graphs by Wijaya, Kristiana, Baskoro, Edy Tri, Assiyatun, Hilda, Suprijanto, Djoko

“…Let R ( G , H ) denote the set of all graphs F satisfying F → ( G , H ) and for every e ∈ E ( F ) , ( F - e ) ↛ ( G , H ) . In this paper, we derive the…”
Get full text

On Ramsey (4K2 , P3) -minimal graphs by Kristiana Wijaya, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto

“…Let F , G , and H be simple graphs. We write F → (G , H) to mean that any red–blue coloring of all edges of F will contain either a red copy of G or a blue…”
Get full text

POLINOMIAL KROMATIK PADA GRAF KIPAS by Maulana, Nur Ridwan, Wijaya, Kristiana, Santoso, Kiswara Agung

“…A chromatic polynomial of a graph G is a special function that describes the number of ways we can achieve a proper coloring on the vertices of G given k…”
Get full text

On Total Vertex Irregularity Strength of Cocktail Party Graph by Kristiana Wijaya, S Slamin, Mirka Miller

“…A vertex irregular total k-labeling of a graph G is a function λ from both the vertex and the edge sets to {1,2,3,,k} such that for every pair of distinct…”
Get full text

On Distance Antimagic Graphs by Simanjuntak, Rinovia, Wijaya, Kristiana

“…For an arbitrary set of distances $D\subseteq \{0,1, \ldots, diam(G)\}$, a $D$-weight of a vertex $x$ in a graph $G$ under a vertex labeling $f:V\rightarrow…”
Get full text