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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Alfarisi, Ridho	-
dc.contributor.author	Dafik, Dafik	-
dc.contributor.author	Kristiana, Arika Indah	-
dc.contributor.author	Albirri, Ermita Rizki	-
dc.contributor.author	Agustin, Ika Hesti	-
dc.date.accessioned	2018-10-29T07:47:50Z	-
dc.date.available	2018-10-29T07:47:50Z	-
dc.date.issued	2018-10-29	-
dc.identifier.isbn	978-0-7354-1730-4	-
dc.identifier.uri	http://repository.unej.ac.id/handle/123456789/87570	-
dc.description	AIP Conf. Proc. 2014, 020012-1–020012-5; https://doi.org/10.1063/1.5054416	en_US
dc.description.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,	en_US
dc.language.iso	en	en_US
dc.subject	Non-Isolated Resolving Number	en_US
dc.subject	Homogeneous Pendant Edges	en_US
dc.title	Non-Isolated Resolving Number of Graphs with Homogeneous Pendant Edges	en_US
dc.type	Prosiding	en_US
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