Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : Contemporary Mathematics and Applications (ConMathA)

Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Keluarga Graf Unicyclic Arika Indah Kristiana; Muhammad Gufronil Halim; Robiatul Adawiyah
Contemporary Mathematics and Applications (ConMathA) Vol. 4 No. 1 (2022)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20473/conmatha.v4i1.33607

Abstract

The graph in this paper is a simple and connected graph with V(G) is vertex set and  E(G) is edge set. An inklusif local irregularity vertex coloring is defined should be maping l:V(G) à {1,2,…, k} as vertex labeling and wi : V(G) à N is function of inclusive local irregularity vertex coloring, with wi(v) = l(v) + ∑u∈N(v) l(u) in other words, an inclusive local irregularity vertex coloring is to assign a color to the graph with the resulting weight value by adding up the labels of the vertices that are should be neighboring to its own label. The minimum number of colors produced from inclusive local irregularity vertex coloring of graph G is called inclusive chromatic number local irregularity, denoted by Xlisi(G). Should be in this paper, we learn about the inclusive local irregularity vertex coloring and determine the chromatic number on unicyclic graphs.
Resolving Independent Dominating Set pada Graf Bunga, Graf Gear, dan Graf Bunga Matahari Rafiantika Megahniah Prihandini; Nabilah Ayu Az-Zahra; Dafik; Antonius Cahya Prihandoko; Robiatul Adawiyah
Contemporary Mathematics and Applications (ConMathA) Vol. 5 No. 2 (2023)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20473/conmatha.v5i2.47046

Abstract

Resolving independent dominating set is the development of metric dimension and independent dominating set. Resolving independent dominating sets is a concept which discusses about determining the minimum vertex on a graph provided that the vertex that becomes the dominating set can dominate the surrounding vertex and there are no two adjacent vertices dominator and also meet the requirement of metric dimension where each vertex in graph G must have a different representation which respect to the resolving independent dominating set . In this study, we examined the resolving independent dominating set of flower graphs, gear graphs, and sunflower graphs.
Pewarnaan Titik Ketakteraturan Lokal pada Hasil Operasi Amalgamasi Titik Graf Lintasan Rafelita Faradila Sandi; Arika Indah Kristiana; Lioni Anka Monalisa; Slamin; Robiatul Adawiyah
Contemporary Mathematics and Applications (ConMathA) Vol. 5 No. 2 (2023)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20473/conmatha.v5i2.47904

Abstract

Definition of graph is set pair (????(????),????(????)) where ????(????) is vertex set and ????(????) is edge set. A maping ???? : ????(????)→{1,2, … ,????} as label function and weight function ???? : ????(????)→???? is desined as ????(????)=Σ????∈????(????)????(????). The function ???? is called local irregularity vertex coloring if: (i) ????????????(????)=???????????? (???????????????? (????????) ;???????? ???????? ???????????????????? ????????????????????????????????) and (ii) for every ???????? ∈ ????(????),????(????) ≠ ????(????). The chromatic number of local irregularity vertex coloring denoted by ????????????????(????) is defined as ????????????????(????)=????????????{|????(????(????))|;???? ???????? ???????????????????? ???????????????????????????????????????????????? ???????????????????????? ????????????????????????????????}. The method used in this paper is pattern recognition and axiomatic deductive method. In this paper, we learn local irregularity vertex coloring of vertex amalgamation of path graph and determine the chromatic number on local irregularity vertex coloring of vertex amalgamation of path graph. This paper use vertex amalgamation of path graph (????????????????(???????? ,????,????)). The result of this study are expected to be used as basic studies and science development as well as applications related to local irregularity vertex coloring of vertex amalgamation of path graph.