Results 31 to 40 of about 81 (79)
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.This article explores numerous significant additive topological indices based on degrees for linear functional graphs over finite‐dimensional vector spaces. Specifically, we derive some unique topological indices, such as the eccentricity‐based indices and the Wiener index.
Vinnarasi L. +4 more
wiley +1 more source
Sharp bounds for partition dimension of generalized Möbius ladders
Open Mathematics, 2018 The concept of minimal resolving partition and resolving set plays a pivotal role in diverse areas such as robot navigation, networking, optimization, mastermind games and coin weighing.
Hussain Zafar +4 more
doaj +1 more source
Cyclic Cordial Labeling for the Lemniscate Graphs and Their Second Powers
Journal of Mathematics, Volume 2025, Issue 1, 2025.A lemniscate graph, usually denoted by Ln,m, is defined as a union of two cycles Cn and Cm that share a common vertex. A simple graph is called cyclic group cordial if we can provide a three elements’ cyclic group labeling satisfying certain conditions.
M. A. AbdAllah +4 more
wiley +1 more source
On the Number of α-Labeled Graphs
Discussiones Mathematicae Graph Theory, 2018 When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of the graph, it becomes an α-labeling. This is the most restrictive type of difference-vertex labeling and it is located at the very core of this research ...
Barrientos Christian, Minion Sarah
doaj +1 more source
The Distance Magic Index of a Graph
Discussiones Mathematicae Graph Theory, 2018 Let G be a graph of order n and let S be a set of positive integers with |S| = n. Then G is said to be S-magic if there exists a bijection ϕ : V (G) → S satisfying ∑x∈N(u)ϕ(x) = k (a constant) for every u ∈ V (G). Let α(S) = max{s : s ∈ S}.
Godinho Aloysius +2 more
doaj +1 more source
Decomposition of Certain Complete Bipartite Graphs into Prisms
Discussiones Mathematicae Graph Theory, 2017 Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj +1 more source
Union of Distance Magic Graphs
Discussiones Mathematicae Graph Theory, 2017 A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ from V to the set {1, . . . , n} such that the weight w(x) = ∑y∈NG(x) ℓ(y) of every vertex x ∈ V is equal to the same element μ, called the magic constant.
Cichacz Sylwia, Nikodem Mateusz
doaj +1 more source
Pair L(2, 1)-Labelings of Infinite Graphs
Discussiones Mathematicae Graph Theory, 2019 An L(2, 1)-labeling of a graph G = (V,E) is an assignment of nonnegative integers to V such that two adjacent vertices must receive numbers (labels) at least two apart and further, if two vertices are in distance 2 then they receive distinct labels. This
Yeh Roger K.
doaj +1 more source
Computing the total H-irregularity strength of edge comb product of graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 A simple undirected graph = (V Γ, EΓ) admits an H-covering if every edge in E belongs to at least one subgraph of that is isomorphic to a graph H. For any graph admitting H-covering, a total labelling β : VΓ ∪EΓ→{1, 2, …, p} is called an H-irregular ...
Wahyujati Mohamad Fahruli, Susanti Yeni
doaj +1 more source
Open MathematicsIn the context of a simple undirected graph GG, a kk-prime labeling refers to assigning distinct integers from the set {k,k+1,…,∣V(G)∣+k−1}\left\{k,k+1,\ldots ,| V\left(G)| +k-1\right\} to its vertices, such that adjacent vertices in GG are labeled with ...
Abughneim Omar A., Abughazaleh Baha’
doaj +1 more source