Results 21 to 30 of about 1,270,493 (107)
Symmetric cryptography approach based on odd graceful labeling
Scientific AfricanIn 1967, Rosa proposed the concept of graph labeling of a graph and the concept of the odd graceful labeling was introduced by Gnanajothi in 1991 as follows: Consider a graph G with q edges to be odd-graceful if there is an injection f from V ( G ) t o {
M.E. Abdel-Aal +3 more
doaj +1 more source
Odd Harmonious Labeling of Some Graphs [PDF]
, 2012 The labeling of discrete structures is a potential area of research due to its wide range of applications.
Shah, N.H., Vaidya, S.K.
core +1 more source
, 2021 We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers.
Kalpana Mahalingam +1 more
core +1 more source
Analytic Philosophy, EarlyView.ABSTRACT I develop and defend a sense‐datum theory of perception. My theory follows the spirit of classic sense‐datum theories: I argue that what it is to have a perceptual experience is to be acquainted with some sense‐data, where sense‐data are private particulars that have all the properties they appear to have, that are common to both perception ...
Andrew Y. Lee
wiley +1 more source
Simonovits's theorem in random graphs
Proceedings of the London Mathematical Society, Volume 133, Issue 4, October 2026.Abstract Let H$H$ be a graph with χ(H)=r+1$\chi (H) = r+1$. Simonovits's theorem states that, if H$H$ is edge‐critical, the unique largest H$H$‐free subgraph of Kn$K_n$ is its largest r$r$‐partite subgraph, provided that n$n$ is sufficiently large. We show that the same holds with Kn$K_n$ replaced by the binomial random graph Gn,p$G_{n,p}$ whenever H$H$
Ilay Hoshen, Wojciech Samotij
wiley +1 more source
On Cubic Graceful Labeling [PDF]
, 2017 A graph with n vertex and m edges is said to be cubic graceful labeling if its vertices are labeled with distinct integers {0,1,2,3,……..,m3} such that for each edge f*( uv) induces edge mappings are {13,23,33,……,m3}.
, Mathew Varkey T. K, Mini. S. Thomas
core +1 more source
On the detection of knots by their traces in high dimensions
Proceedings of the London Mathematical Society, Volume 133, Issue 4, October 2026.Abstract For every n⩾4$n\geqslant 4$, we demonstrate the existence of non‐isotopic, smooth (n−2)$(n-2)$‐knots in Sn$S^n$ with diffeomorphic traces. We give two proofs: the first by generalising the RBG link construction to all dimensions, and the second as an application of work of Plotnick.
Valentina Bais +10 more
wiley +1 more source
E-cordial Labeling for Cartesian Product of Some Graphs [PDF]
, 2011 We investigate E-cordial labeling for some cartesian product of graphs. We prove that the graphs Kn × P2 and Pn × P2 are E-cordial for n even while Wn × P2 andK1,n × P2 are E-cordial for n odd.
Vaidya, S. K., Vyas, N. B.
core +1 more source
Random Generation Topology Coding Technique in Asymmetric Topology Encryption
MathematicsThe security of traditional public key cryptography algorithms depends on the difficulty of the underlying mathematical problems. Asymmetric topological encryption is a graph-dependent encryption algorithm produced to resist attacks by quantum computers ...
Jing Su, Bing Yao
doaj +1 more source
Odd-Graceful Total Colorings for Constructing Graphic Lattice
, 2021 The security of passwords generated by the graphic lattices is based on the difficulty of the graph isomorphism, graceful tree conjecture, and total coloring conjecture.
Hui Sun, Bing Yao, Jing Su
core +1 more source