Sagala, Yuri C and Susiana (2016) L(2,1)-LABELING OF COMPLETE MULTIPARTITE GRAPHS. In: The 3rd Annual International Seminar on Trends in Science and Science Education 2016, 7 Oct 2016, Medan.
Full text not available from this repository.
Official URL: http://sitsefmipa.unimed.ac.id/proceeding2016/sits...
Abstract
: -number of a graphs G G admits a label
vertices at distance two get different labels and adjacent vertices get labels that are at least two apart. Complete multipartite
graph (or complete p-partite graph) is that graph G whose vertex set can be partitioned into p subsets A1, A2,..., Ap
(also called partite sets) with |Ai| = ai for , and |Ai| is the cardinality of each partite sets, such that uv E(G) if u Ai and v Aj smallest maximum labeling number of complete p-partite
graphs is .
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Divisions: | Program Pasca Sarjana |
| Depositing User: | Mrs Yuni Chairani |
| Date Deposited: | 15 Dec 2017 04:16 |
| Last Modified: | 15 Dec 2017 04:16 |
| URI: | https://digilib.unimed.ac.id/id/eprint/27866 |
Actions (login required)
- View Item