EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH
Graph is a simple, connected, undirected graph with vertex set and edge set . A graph is called to have an edge irregular reflexive -labeling if its vertices can be labeled with even numbers from until and its edges can be labeled with positive integers from to such that the weights...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Pattimura
2024-10-01
|
| Series: | Barekeng |
| Subjects: | |
| Online Access: | https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/13892 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849237979754659840 |
|---|---|
| author | Thetania Miftakul Zalsa Diari Indriati Titin Sri Martini |
| author_facet | Thetania Miftakul Zalsa Diari Indriati Titin Sri Martini |
| author_sort | Thetania Miftakul Zalsa |
| collection | DOAJ |
| description | Graph is a simple, connected, undirected graph with vertex set and edge set . A graph is called to have an edge irregular reflexive -labeling if its vertices can be labeled with even numbers from until and its edges can be labeled with positive integers from to such that the weights for all the edges are different, where . The weight of edge uv in graph with labeling, denoted by , is defined as sum of the edge label and all vertex labels incident to that edge. The reflexive edge strength of a graph , denoted by , is the value of minimum of the largest label. In this paper, edge irregular reflexive -labeling for Dumbbell Graph and corona of open ladder and null graph will be determined. The reflexive edge strength of the Dumbbell Graph with and is for and for The reflexive edge strength of the corona of open ladder and null graph with n ≥ 3 and m ≥ 1 is for and for . |
| format | Article |
| id | doaj-art-18aea64eafd347f8bb556db2a90a09dd |
| institution | Kabale University |
| issn | 1978-7227 2615-3017 |
| language | English |
| publishDate | 2024-10-01 |
| publisher | Universitas Pattimura |
| record_format | Article |
| series | Barekeng |
| spelling | doaj-art-18aea64eafd347f8bb556db2a90a09dd2025-08-20T04:01:48ZengUniversitas PattimuraBarekeng1978-72272615-30172024-10-011842767277810.30598/barekengvol18iss4pp2767-277813892EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPHThetania Miftakul Zalsa0Diari Indriati1Titin Sri Martini2Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Sebelas Maret, IndonesiaDepartment of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Sebelas Maret, IndonesiaDepartment of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Sebelas Maret, IndonesiaGraph is a simple, connected, undirected graph with vertex set and edge set . A graph is called to have an edge irregular reflexive -labeling if its vertices can be labeled with even numbers from until and its edges can be labeled with positive integers from to such that the weights for all the edges are different, where . The weight of edge uv in graph with labeling, denoted by , is defined as sum of the edge label and all vertex labels incident to that edge. The reflexive edge strength of a graph , denoted by , is the value of minimum of the largest label. In this paper, edge irregular reflexive -labeling for Dumbbell Graph and corona of open ladder and null graph will be determined. The reflexive edge strength of the Dumbbell Graph with and is for and for The reflexive edge strength of the corona of open ladder and null graph with n ≥ 3 and m ≥ 1 is for and for .https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/13892reflexive edge strengthdumbbell graphcoronaopen ladder graphnull graph |
| spellingShingle | Thetania Miftakul Zalsa Diari Indriati Titin Sri Martini EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH Barekeng reflexive edge strength dumbbell graph corona open ladder graph null graph |
| title | EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH |
| title_full | EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH |
| title_fullStr | EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH |
| title_full_unstemmed | EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH |
| title_short | EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH |
| title_sort | edge irregular reflexive labeling of dumbbell graph corona of open ladder and null graph |
| topic | reflexive edge strength dumbbell graph corona open ladder graph null graph |
| url | https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/13892 |
| work_keys_str_mv | AT thetaniamiftakulzalsa edgeirregularreflexivelabelingofdumbbellgraphcoronaofopenladderandnullgraph AT diariindriati edgeirregularreflexivelabelingofdumbbellgraphcoronaofopenladderandnullgraph AT titinsrimartini edgeirregularreflexivelabelingofdumbbellgraphcoronaofopenladderandnullgraph |