Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Eksakta : Berkala Ilmiah Bidang MIPA

BEBERAPA SYARAT CUKUP UNTUK BILANGAN KROMATIK LOKASI HINGGA PADA GRAF TAK TERHUBUNG Des Welyyanti
EKSAKTA: Berkala Ilmiah Bidang MIPA Vol. 19 No. 1 (2018): Eksakta : Berkala Ilmiah Bidang MIPA (E-ISSN : 2549-7464)
Publisher : Faculty of Mathematics and Natural Sciences (FMIPA), Universitas Negeri Padang, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1114.488 KB) | DOI: 10.24036/eksakta/vol19-iss1/130

Abstract

The locating-chromatic number of a graph is introduced by Chartrand et al. in 2002. Firstly, Chatrand et al. determine the locating-chromatic number of path and double stars. The locating-chromatic number is an interesting concept ini graph theory. In this paper, we determine some condtions for disconnected graphs has a finite locating-chromatic number.
On the Rainbow Connection Number for Snowflake Graph Lyra Yulianti; Muhammad Rafif Fajri; Des Welyyanti; Aisyah Nurinsani
EKSAKTA: Berkala Ilmiah Bidang MIPA Vol. 24 No. 01 (2023): Eksakta : Berkala Ilmiah Bidang MIPA (E-ISSN : 2549-7464)
Publisher : Faculty of Mathematics and Natural Sciences (FMIPA), Universitas Negeri Padang, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24036/eksakta/vol24-iss01/374

Abstract

Let G be an arbitrary non-trivial connected graph. An edge-colored graph G is called a rainbow connected if any two vertices are connected by a path whose edges have distinct colors, such path is called a rainbow path. The smallest number of colors required to make G rainbow connected is called the rainbow connection number of G, denoted by rc(G). A snowflake graph is a graph obtained by resembling one of the snowflake shapes into vertices and edges so that it forms a simple graph. Let  be a generalized snowflake graph, i.e., a graph with  paths of the stem,  pair of outer leaves,  middle circles, and  pairs of inner leaves. In this paper we determine the rainbow connection number for generalized snowflake graph .