Graphs with Partition Dimension 3 and Locating-chromatic Number 4

Debi Oktia Haryeni, Edy Tri Baskoro

2019

Abstract

The characterization study of all graphs with partition dimension either $2,n-2,n-1$ or $n$ has been completely done. In the case of locating-chromatic numbers, the efforts in characterizing all graphs with locating-chromatic number either $2,3,n-1$ or $n$ have reached to complete results. In this paper we present methods to obtain a family of graphs having partition dimension 3 or locating-chromatic number 4 by using the previous known results.

Paper Citation

in Harvard Style

Haryeni D. and Baskoro E. (2019). Graphs with Partition Dimension 3 and Locating-chromatic Number 4. In Proceedings of the 1st International MIPAnet Conference on Science and Mathematics - Volume 1: IMC-SciMath, ISBN 978-989-758-556-2, pages 14-19. DOI: 10.5220/0009876400002775

in Bibtex Style

@conference{imc-scimath19,
author={Debi Oktia Haryeni and Edy Tri Baskoro},
title={Graphs with Partition Dimension 3 and Locating-chromatic Number 4},
booktitle={Proceedings of the 1st International MIPAnet Conference on Science and Mathematics - Volume 1: IMC-SciMath,},
year={2019},
pages={14-19},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009876400002775},
isbn={978-989-758-556-2},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 1st International MIPAnet Conference on Science and Mathematics - Volume 1: IMC-SciMath,
TI - Graphs with Partition Dimension 3 and Locating-chromatic Number 4
SN - 978-989-758-556-2
AU - Haryeni D.
AU - Baskoro E.
PY - 2019
SP - 14
EP - 19
DO - 10.5220/0009876400002775