MULTIPLE DIAMOND GRAPH LABELINGS

Let G = (V (G),E(G)) be afinite,undirected,andsimplegraph.Thisstudyuses diamond graphs.Foranaturalnumber n with n ? 2, adiamondgraphthathas 2n vertices and 5n ? 5 edgesisdenotedby Brn. Observedseverallabelsonadia- mond graph,suchasanedge-magicvertex-labeling,avertex (a, d)-edgeantimagic labeling...

Full description

Saved in:
Bibliographic Details
Main Author: Arif Susilo, Alfiatri
Format: Theses
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/71878
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
id id-itb.:71878
spelling id-itb.:718782023-02-27T14:14:47ZMULTIPLE DIAMOND GRAPH LABELINGS Arif Susilo, Alfiatri Indonesia Theses diamondgraph,edge-magicvertex-labeling,edge-magictotal-labeling, edge (a, d)-vertexantimagiclabeling,totalmagic-C3 diamond graphlabeling,to- tal (a, d)-C3-antimagicgraphlabeling,vertex-magicedge-labeling,vertex-magic total-labeling,vertex (a, d)-edgeantimagiclabeling. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/71878 Let G = (V (G),E(G)) be afinite,undirected,andsimplegraph.Thisstudyuses diamond graphs.Foranaturalnumber n with n ? 2, adiamondgraphthathas 2n vertices and 5n ? 5 edgesisdenotedby Brn. Observedseverallabelsonadia- mond graph,suchasanedge-magicvertex-labeling,avertex (a, d)-edgeantimagic labeling,avertex-magicedge-labeling,anedge (a, d)-vertexantimagiclabeling,a vertexmagictotallabeling,anedgemagictotallabeling,amagic-C3 total-labeling, and atotal (a, d)-C3-antimagicgraphlabeling.Weobtainsomeresultsasfollows. A graph Br2 has anedge (a, d)-vertexantimagiclabeling,avertexmagictotallabe- ling,anedgemagictotallabeling,amagic-C3 total-labeling,andatotal (a, d)-C3- antimagicgraphlabeling,buthasnoanedge-magicvertex-labeling,avertex-magic edge-labeling,andanedge (a, d)-vertexantimagiclabeling.For n ? 3, agraph Brn has noedge-magicvertex-labelingandvertex (a, d)-edgeantimagiclabeling. It isalsoshownthatthegraph Brn for n ?= 20 has avertex-magicedge-labeling if andonlyif n = 4 or n = 5. Thengiventhenecessaryconditionthatagraph Brn for any n ? 3 has anedge (a, d)-vertexantimagiclabeling.Besidesthat, given amagicconstantvalueofagraph Brn for any n ? 3 whichhasavertex- magictotal-labeling,anedge-magictotal-labeling,amagic-C3 total-labeling,or an (a, d)-C3-anti magictotal-labeling. text
institution Institut Teknologi Bandung
building Institut Teknologi Bandung Library
continent Asia
country Indonesia
Indonesia
content_provider Institut Teknologi Bandung
collection Digital ITB
language Indonesia
description Let G = (V (G),E(G)) be afinite,undirected,andsimplegraph.Thisstudyuses diamond graphs.Foranaturalnumber n with n ? 2, adiamondgraphthathas 2n vertices and 5n ? 5 edgesisdenotedby Brn. Observedseverallabelsonadia- mond graph,suchasanedge-magicvertex-labeling,avertex (a, d)-edgeantimagic labeling,avertex-magicedge-labeling,anedge (a, d)-vertexantimagiclabeling,a vertexmagictotallabeling,anedgemagictotallabeling,amagic-C3 total-labeling, and atotal (a, d)-C3-antimagicgraphlabeling.Weobtainsomeresultsasfollows. A graph Br2 has anedge (a, d)-vertexantimagiclabeling,avertexmagictotallabe- ling,anedgemagictotallabeling,amagic-C3 total-labeling,andatotal (a, d)-C3- antimagicgraphlabeling,buthasnoanedge-magicvertex-labeling,avertex-magic edge-labeling,andanedge (a, d)-vertexantimagiclabeling.For n ? 3, agraph Brn has noedge-magicvertex-labelingandvertex (a, d)-edgeantimagiclabeling. It isalsoshownthatthegraph Brn for n ?= 20 has avertex-magicedge-labeling if andonlyif n = 4 or n = 5. Thengiventhenecessaryconditionthatagraph Brn for any n ? 3 has anedge (a, d)-vertexantimagiclabeling.Besidesthat, given amagicconstantvalueofagraph Brn for any n ? 3 whichhasavertex- magictotal-labeling,anedge-magictotal-labeling,amagic-C3 total-labeling,or an (a, d)-C3-anti magictotal-labeling.
format Theses
author Arif Susilo, Alfiatri
spellingShingle Arif Susilo, Alfiatri
MULTIPLE DIAMOND GRAPH LABELINGS
author_facet Arif Susilo, Alfiatri
author_sort Arif Susilo, Alfiatri
title MULTIPLE DIAMOND GRAPH LABELINGS
title_short MULTIPLE DIAMOND GRAPH LABELINGS
title_full MULTIPLE DIAMOND GRAPH LABELINGS
title_fullStr MULTIPLE DIAMOND GRAPH LABELINGS
title_full_unstemmed MULTIPLE DIAMOND GRAPH LABELINGS
title_sort multiple diamond graph labelings
url https://digilib.itb.ac.id/gdl/view/71878
_version_ 1822006704167976960