Show simple item record

dc.contributor.authorAlfarisi, Ridho
dc.contributor.authorDafik, Dafik
dc.contributor.authorKristiana, Arika Indah
dc.contributor.authorAlbirri, Ermita Rizki
dc.contributor.authorAgustin, Ika Hesti
dc.date.accessioned2018-10-29T07:47:50Z
dc.date.available2018-10-29T07:47:50Z
dc.date.issued2018-10-29
dc.identifier.isbn978-0-7354-1730-4
dc.identifier.urihttp://repository.unej.ac.id/handle/123456789/87570
dc.descriptionAIP Conf. Proc. 2014, 020012-1–020012-5; https://doi.org/10.1063/1.5054416en_US
dc.description.abstractA 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.isoenen_US
dc.subjectNon-Isolated Resolving Numberen_US
dc.subjectHomogeneous Pendant Edgesen_US
dc.titleNon-Isolated Resolving Number of Graphs with Homogeneous Pendant Edgesen_US
dc.typeProsidingen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record