Results 101 to 110 of about 181 (130)
Some of the next articles are maybe not open access.
Edge Irregular Reflexive Labeling for Some Classes of Plane Graphs
Malaysian Journal of Mathematical Sciences, 2022For 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. +3 more
openaire +1 more source
On edge irregular reflexive labeling for Cartesian product of two graphs
The European Physical Journal Plus, 2021A graph labeling is an algorithm that assignment the labels, traditionally represented by integers, to the edges or vertices, or both, of a network(graph) G. Formally, given a graph $$G = (V, E)$$ , a vertex labeling is a function of V to a set of labels.
Yongsheng Ke +3 more
openaire +1 more source
EDGE IRREGULAR REFLEXIVE LABELING ON LOBSTER GRAPH
Journal of Mathematical Sciences and OptimizationLet $G$ be a lobster graph that have three layer of vertices where each layer is connected to each other. The total labeling of the graph is called an edge irregular reflexive $k$-labeling if the total weight of two incident vertices and the edge that joins it is different for all possible edges on the graph.
Verrel Rievaldo Wijaya +1 more
openaire +1 more source
Edge irregular reflexive labelling on corona of cycle and null graph
AIP Conference Proceedings, 2022Irfan Setiawan +2 more
openaire +1 more source
Edge irregular reflexive labeling of palm tree graph C3−B2,r and C3−B3,r
AIP Conference Proceedings, 2022Rakel Junetty +2 more
openaire +1 more source
Edge learning using a fully integrated neuro-inspired memristor chip
Science, 2023, Peng Yao, Bin Gao
exaly