Results 21 to 30 of about 6,181 (108)
Edge irregular total labellings for graphs of linear size
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brandt, Stephan +2 more
openaire +2 more sources
On Total H-Irregularity Strength of the Disjoint Union of Graphs
Discussiones Mathematicae Graph Theory, 2020 A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and
Ashraf Faraha +5 more
doaj +1 more source
Total Edge Fibonacci Irregular Labeling of some Star Graphs
International Journal of Mathematics and Soft Computing, 2015 A total edge Fibonacci irregular labeling f : V (G) S E(G) → {1, 2, . . . ,K} of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any different edges xy and x 0 y 0 their weights f( x ) + f( xy ) + f( y ) and f( x 0 ) + f( x 0 y 0 ) + f( y 0 ) are distinct Fibonacci numbers.
R. Sridevi +2 more
openaire +1 more source
Indonesian Journal of Combinatorics, 2020 Given graph G(V,E). We use the notion of total k-labeling which is edge irregular. The notion of total edge irregularity strength (tes) of graph G means the minimum integer k used in the edge irregular total k-labeling of G.
Isnaini Rosyida, Diari Indriati
doaj +1 more source
On irregularity strength of disjoint union of friendship graphs
Electronic Journal of Graph Theory and Applications, 2013 We investigate the vertex total and edge total modication of the well-known irregularity strength of graphs. We have determined the exact values of the total vertex irregularity strength and the total edge irregularity strength of a disjoint union of ...
Ali Ahmad, Martin Baca, Muhammad Numan
doaj +1 more source
On the Construction of the Reflexive Vertex k-Labeling of Any Graph with Pendant Vertex
International Journal of Mathematics and Mathematical Sciences, 2020 A total k-labeling is a function fe from the edge set to first natural number ke and a function fv from the vertex set to non negative even number up to 2kv, where k=maxke,2kv.
I. H. Agustin +4 more
doaj +1 more source
On cycle-irregularity strength of ladders and fan graphs
Electronic Journal of Graph Theory and Applications, 2020 A simple graph G = (V(G),E(G)) admits an H-covering if every edge in E(G) belongs to at least one subgraph of G isomorphic to a given graph H. A total k-labeling φ : V(G) ∪ E(G) → {1,2,..., k} is called to be an H-irregular total k-labeling of the graph ...
Faraha Ashraf +3 more
doaj +1 more source
THE ENTIRE FACE IRREGULARITY STRENGTH OF A BOOK WITH POLYGONAL PAGES
Barekeng, 2015 A face irregular entire labeling is introduced by Baca et al. recently, as a modification of the well-known vertex irregular and edge irregular total labeling of graphs and the idea of the entire colouring of plane graph.
Meilin I. Tilukay, Venn Y. I. Ilwaru
doaj +1 more source
The total disjoint irregularity strength of some certain graphs
Indonesian Journal of Combinatorics, 2020 Under a totally irregular total k-labeling of a graph G = (V, E), we found that for some certain graphs, the edge-weight set W (E) and the vertex-weight set W (V ) of G which are induced by k=ts(G), W(E)∩W(V) is a non empty set.
Meilin I Tilukay, A. N. M. Salman
doaj +1 more source
Totally irregular total labeling of some caterpillar graphs
Electronic Journal of Graph Theory and Applications, 2020 Assume that G(V,E) is a graph with V and E as its vertex and edge sets, respectively. We have G is simple, connected, and undirected. Given a function λ from a union of V and E into a set of k-integers from 1 until k.
Diari Indriati +4 more
doaj +1 more source