Non-Isolated Resolving Number of  Graphs with Homogeneous Pendant Edges

Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/87570

Title:	Non-Isolated Resolving Number of Graphs with Homogeneous Pendant Edges
Authors:	Alfarisi, Ridho Dafik, Dafik Kristiana, Arika Indah Albirri, Ermita Rizki Agustin, Ika Hesti
Keywords:	Non-Isolated Resolving Number Homogeneous Pendant Edges
Issue Date:	29-Oct-2018
Abstract:	A set is called a resolving set of if every vertices of have diff erent r epr esentation. The minimum cardinalit y of resolving set is metric dimension, denoted by . Furthermore, the resolving set of is called the non-isolated resolving set if there does not for all induced by the non-isolat ed vert ex. A non-isolat ed resolving number, denoted by , is minimum cardinalit y of non-isolated resolving set in . In this research, we obtain the lower bound of the non isolat ed resolving number of graphs with homogeneous pendant edges,
Description:	AIP Conf. Proc. 2014, 020012-1–020012-5; https://doi.org/10.1063/1.5054416
URI:	http://repository.unej.ac.id/handle/123456789/87570
ISBN:	978-0-7354-1730-4
Appears in Collections:	LSP-Conference Proceeding

Files in This Item:

File	Description	Size	Format
F. MIPA_Prosiding_Ika Hesty A_Non-isolated resolving number of graphs.pdf		798.07 kB	Adobe PDF	View/Open

DSpace JSPUI