Graph labeling
JA Gallian - The electronic journal of combinatorics, 2012 - combinatorics.org
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …
On irregularity strength of diamond network
Full article: On irregularity strength of diamond network Skip to Main Content Taylor and
Francis Online homepage Taylor and Francis Online homepage Log in | Register Cart 1.Home …
Francis Online homepage Taylor and Francis Online homepage Log in | Register Cart 1.Home …
[PDF][PDF] The total vertex irregularity strength of generalized helm graphs and prisms with outer pendant edges.
D Indriati, IE Widodo, IE Wijayanti… - Australas. J …, 2016 - ajc.maths.uq.edu.au
The total vertex irregularity strength of generalized helm graphs and prisms with outer pendant
edges Page 1 AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 65(1) (2016), Pages …
edges Page 1 AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 65(1) (2016), Pages …
Total vertex irregularity strength of trees with maximum degree five.
ET Baskoro, R Simanjuntak - Electronic Journal of Graph …, 2018 - search.ebscohost.com
Abstract In 2010, Nurdin, Baskoro, Salman and Gaos conjectured that the total vertex
irregularity strength of any tree Т is determined only by the number of vertices of degrees 1 …
irregularity strength of any tree Т is determined only by the number of vertices of degrees 1 …
Some families of convex polytopes labeled by 3-total edge product cordial labeling
For a graph G=(VG, EG), consider a mapping h: EG→{0, 1, 2,..., k− 1}, 2≤ k≤| EG| which
induces a mapping h∗: VG→{0, 1, 2,..., k− 1} such that h∗(v)= Qn i= 1 h (ei)(mod k), where ei …
induces a mapping h∗: VG→{0, 1, 2,..., k− 1} such that h∗(v)= Qn i= 1 h (ei)(mod k), where ei …
Determining total vertex irregularity strength of Tr (4, 1) tadpole chain graph and its computation
I Rosyida, D Indriati - Procedia Computer Science, 2019 - Elsevier
In this research, we examine total vertex irregularity strength (tvs) of tadpole chain graph T r
(4, 1) with length r. We obtain that tvs (T r (4, 1))=⌈ 4r+ 2/5⌉. Further, we construct algorithm …
(4, 1) with length r. We obtain that tvs (T r (4, 1))=⌈ 4r+ 2/5⌉. Further, we construct algorithm …
On valuation of edge irregularity strength of certain graphical families
This article comprises of exact valuation of a graph parameter, known as the edge
irregularity strength (EIS), symbolized as eis (G), of various graphical families such as …
irregularity strength (EIS), symbolized as eis (G), of various graphical families such as …
Total irregularity strengths of an arbitrary disjoint union of (3, 6)-fullerenes
Aims and Objective: A fullerene graph is a mathematical model of a fullerene molecule. A
fullerene molecule, or simply a fullerene, is a polyhedral molecule made entirely of carbon …
fullerene molecule, or simply a fullerene, is a polyhedral molecule made entirely of carbon …
Total Irregularity Strengths of a Disjoint Union of (4, 6)-Fullerene Graphs
A fullerene is a polyhedral molecule made entirely of carbon atoms other than graphite and
diamond. Mathematical chemistry or Chemical graph theory as a combination of chemistry …
diamond. Mathematical chemistry or Chemical graph theory as a combination of chemistry …
[PDF][PDF] NILAI KETAKTERATURAN TITIK TOTAL PADA GRAF DOVE TAIL DENGAN TITIK PENDAN DAN GRAF RANTAI KAKTUS CYCLE C8 DENGAN TITIK PENDAN
CF Andriyan, I Rosyida - Unnes Journal of Mathematics, 2022 - journal.unnes.ac.id
Diketahui graf 𝐺 dengan himpunan titik tak kosong 𝑉 (𝐺) dan himpunan sisi 𝐸 (𝐺).
Pelabelan 𝜆∶ 𝑉 (𝐺)∪ 𝐸 (𝐺)→{1, 2, 3….. 𝑘} dikatakan pelabelan-k total tak teratur titik di G …
Pelabelan 𝜆∶ 𝑉 (𝐺)∪ 𝐸 (𝐺)→{1, 2, 3….. 𝑘} dikatakan pelabelan-k total tak teratur titik di G …