Results 221 to 230 of about 34,731 (238)

On (a,d)-total edge irregular labelings

Discrete Mathematics, Algorithms and Applications, 2023
A total edge irregular [Formula: see text]-labeling of a graph [Formula: see text], [Formula: see text] is a labeling of vertices and edges of [Formula: see text] in such a way that the weights of all edges are distinct. A total edge irregularity strength of graph [Formula: see text], denoted by [Formula: see text] is defined as the minimum [Formula ...
Mitra, Sarbari, Bhoumik, Soumya
openaire   +1 more source

Irregular total labellings of Ladder

16th Int'l Conf. Computer and Information Technology, 2014
The total edge irregularity strength tes(G) and total vertex irregularity strength tvs(G) are invariants analogous to irregular strength s(G) of a graph G for total labellings. Baca et al. [Discrete Mathematics, 307: 1378-1388, (2007)] determined the bounds and precise values for some families of graphs concerning these parameters.
K. M. Mominul Haque, Umme Narseen Khanam
openaire   +1 more source

Pyramidal Connected Component Labeling by Irregular Graph Pyramid

2021 5th International Conference on Pattern Recognition and Image Analysis (IPRIA), 2021
This paper presents a new logarithmic-time algorithm which simultaneously assigns labels to all connected components of a binary image in parallel. The irregular graph pyramid of an input binary image is constructed based on the optimized combinatorial structure.
Majid Banaeyan, Walter G. Kropatsch
openaire   +1 more source

Edge Irregular Reflexive Labeling for Some Classes of Plane Graphs

Malaysian Journal of Mathematical Sciences, 2022
For a graph G, we define a total k-labeling ϕ as a combination of an edge labeling ϕe(x) → {1, 2, . . . , ke} and a vertex labeling ϕv(x) → {0, 2, . . . , 2kv}, such that ϕ(x) = ϕv(x) if x ∈ V (G) and ϕ(x) = ϕe(x) if x ∈ E(G), where k = max {ke, 2kv}. The total k-labeling ϕ is called an edge irregular reflexive k-labeling of G, if for every two edges ...
Yoong, K. K., Hasni, R., Lau, G. C., Irfan, M.   +3 more
openaire   +1 more source

Irregular Total Labellings of Generalized Petersen Graphs

Theory of Computing Systems, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A Note on Distance Irregular Labeling of Graphs

Ars Combinatoria, 2023
Let us consider a~simple connected undirected graph \(G=(V,E)\). For a~graph \(G\) we define a~\(k\)-labeling \(\phi: V(G)\to \{1,2, \dots, k\}\) to be a~distance irregular vertex \(k\)-labeling of the graph \(G\) if for every two different vertices \(u\) and \(v\) of \(G\), one has \(wt(u) \ne wt(v),\) where the weight of a~vertex \(u\) in the ...
openaire   +1 more source