Results 1 to 10 of about 302 (172)
On cordial labeling of hypertrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Let $f:V\rightarrow\mathbb{Z}_k$ be a vertex labeling of a hypergraph $H=(V,E)$. This labeling induces an~edge labeling of $H$ defined by $f(e)=\sum_{v\in e}f(v)$, where the sum is taken modulo $k$.
Michał Tuczyński +2 more
doaj +4 more sources
On 3-total edge product cordial connected graphs [PDF]
Opuscula Mathematica, 2017 A \(k\)-total edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize connected graphs of order at least 15 admitting a 3-total edge product cordial labeling.
Jaroslav Ivančo
doaj +1 more source
E-Cordial Labeling for Cupola Graph Cu(3, b, n)
InPrime, 2022 Graph labeling is a map that maps graph elements such as vertices, edges, vertices, and edges to a set of numbers. A graph labeling is named e-cordial if there is a binary mapping f:E(G)→{0,1} which induces the vertex labeling defined by g(v)=Ʃ_{uvϵE(G)}
Kartika Yulianti +2 more
doaj +1 more source
Some Characterizations and NP-Complete Problems for Power Cordial Graphs
Journal of Mathematics, 2023 A power cordial labeling of a graph G=VG,EG is a bijection f:VG⟶1,2,…,VG such that an edge e=uv is assigned the label 1 if fu=fvn or fv=fun, for some n∈N∪0 and the label 0 otherwise, and satisfy the number of edges labeled with 0 and the number of edges ...
C. M. Barasara, Y. B. Thakkar
doaj +1 more source
On edge product cordial graphs [PDF]
Opuscula Mathematica, 2019 An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize graphs admitting an edge product cordial labeling.
Jaroslav Ivančo
doaj +1 more source
Divided Square Difference Cordial Labeling Of Join Some Spider graphs [PDF]
E3S Web of Conferences, 2023 Let G be a graph with itsvertices and edges. On defining bijective fnnctionρ:V(G) →{0,1,…,p}. For each edge assign the label with 1 if ρ*(ab)=∣ρ(a)2 - ρ(b)2 / ρ(a) - ρ(b)∣ is odd or 0 otherwise such that |eρ(1) -eρ0≤1 then the labeling is called as ...
Christy T., Palani G.
doaj +3 more sources
Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate Graphs
Journal of Mathematics, 2022 A simple graph is called cordial if it admits 0-1 labeling that satisfies certain conditions. The second order of lemniscate graph is a graph of two second order of circles that have one vertex in common.
Ashraf ELrokh +3 more
doaj +1 more source
On Integer Cordial Labeling of Some Families of Graphs
Ratio Mathematica, 2022 An integer cordial labeling of a graph $G(p,q)$ is an injective map $f:V\rightarrow [-\frac{p}{2}...\frac{p}{2}]^*$ or $[-\lfloor{\frac{p}{2}\rfloor}...\lfloor{\frac{p}{2}\rfloor}]$ as $p$ is even or odd, which induces an edge labeling $f^*: E ...
S Sarah Surya, Lian Mathew, Alan Thomas
doaj +1 more source
Pair difference cordial labeling of some star related graphs [PDF]
Journal of Mahani Mathematical Research, 2023 In this paper, we investigate the pair difference cordial labeling behaviour of some star related graphs.
R Ponraj, A Gayathri, S Somasundaram
doaj +1 more source
Total Product and Total Edge Product Cordial Labelings of Dragonfly Graph Dgn
Journal of Mathematics, 2022 In this paper, we study the total product and total edge product cordial labeling for dragonfly graph Dgn. We also define generalized dragonfly graph and find product cordial and total product cordial labeling for this family of graphs.
N. Inayah, A. Erfanian, M. Korivand
doaj +1 more source