Results 31 to 40 of about 1,212,791 (104)
Lucas Graceful Labeling for Some Graphs [PDF]
, 2011 By a graph, we mean a finite undirected graph without loops or multiple ...
Perumal, M.A. +2 more
core +1 more source
PELABELAN ODD-GRACEFUL PADA GRAF PRODUK SISIR
, 2022 Gnanajothi defined a graph with edges to be odd-graceful if there is an injective function such that if every edge is labelled with the resulting edge labels are . She proved that the graph obtained by joining one pendant to every vertex in is odd-
Juan Daniel +3 more
core +1 more source
GRACEFUL LABEING AND RHO TOPI LABELING ON THE 8-BINTANG GRAPH WITH C3 FOR N ODD [PDF]
, 2019 This paper we propose graceful labeling and labeling on a graph then referred to as 8-Bintang graph, the basic idea of formulation graceful labeling and labeling on an alfabet bintang graphs wih the question a stars graph .
Amri, Zulfi; Universitas Muhammadiyah Sumatera Utara +2 more
core +2 more sources
Graphs with edge-odd graceful labelings
International Mathematical Forum, 2013 Solairaju and Chithra [3] introduced a new type of labeling of a graph G with q edges called an edge-odd graceful lebeling if there is a bijection f from the edges of the graph to the set {1, 3, 5, . . . , 2q − 1} such that, when each vertex is assigned the sum of all the edges incident to it mod 2q, the resulting vertex labels are distinct.
openaire +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
Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs [PDF]
, 2022 Let r be any natural number. An injective function , where is the Gaussian Tribonacci number in the Gaussian Tribonacci sequence is said to be Gaussian Tribonacci r-graceful labeling if the induced edge labeling such that is bijective.
Sunitha, K, Sheriba, M
core +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
Becoming Dostoevsky (how Rowan Williams opens up Bakhtin)
Modern Theology, EarlyView.Abstract With the end of Communism in Russia, non‐materialist contexts were enthusiastically restored to Mikhail Bakhtin's globally famous ideas of carnival, dialogism, and polyphony. This essay surveys Rowan Williams's 2008 study Dostoevsky: Language, Faith + Fiction as a major contribution to this effort, concentrating on those general philosophical ...
Caryl Emerson
wiley +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
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