Results 21 to 30 of about 107,087 (251)
Graceful And Graceful Labeling Of Graphs
, 2018 {"references": ["1.\tJ. A. Gallian, A Dynamic survey of graph labeling, The electronic journal of combinatory 16 (2009).DS6. 2.\tI. Gutman, The energy of a graph, Ber. Math-satist. sekt. Forschungsz. Graz 103 (1978), 1-22. 3.\tGutman and B. Zhou, Laplacian energy of a graph, linear algebra appl. 414 (2006), 29-37. 4.\tI.
M. Soundharya, R. Balakumar
openaire +2 more sources
Improper Graceful and Odd-graceful Labellings of Graph Theory
CoRR, 2015 In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having ...
Hongyu Wang 0006, Jin Xu 0002, Bing Yao
openaire +2 more sources
Graceful Labelling for Complete Bipartite Fuzzy Graphs
, 2017 The concept of fuzzy graceful labelling is introduced. A graph which admits a fuzzy graceful labelling is called a fuzzy graceful graph. Fuzzy graceful labelled graphs are becoming an increasingly useful family of mathematical models for a broad range of
R. Jebesty Shajila, S. Vimala
core +1 more source
EVEN GRACEFUL LABELLING OF A CLASS OF TREES
, 2020 A labelling or numbering of a graph G with q edges is an assignment of labels to the vertices of G that induces for each edge uv a labelling depending on the vertex labels f(u) and f(v).
Rajesh Kumar T.J, Mathew Varkey T.K
core +1 more source
Going viral − Virus‐targeting nanobodies for research, diagnostics and therapy
FEBS Letters, EarlyView.The increasing prevalence of viral diseases represents a major threat for global human health. Nanobodies, small binding fragments derived from camelid heavy‐chain antibodies, offer versatile tools for viral research, diagnostics, and antiviral therapy.
Domenic Ebert, Ulrich Rothbauer
wiley +1 more source
A PROCEDURE FOR DERIVING ODD-GRACEFUL CHROMATIC NUMBERS OF GRAPHS
Ural Mathematical JournalLet \(G:=(V,E)\) be an undirected finite simple graph with vertex set \(V\) and edge set \(E\). A function \(c:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\), such that \(c(u)\neq c(v)\) for every edge \(uv\in E(G)\), is called a ...
I Nengah Suparta +3 more
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background We aimed to identify the proportion of individuals with a confirmed diagnosis of childhood absence epilepsy (CAE) or juvenile absence epilepsy (JAE) who show a negative routine EEG (rEEG), and to determine the main factors associated with this finding.
Francesco Fortunato +7 more
wiley +1 more source
Annals of Mathematics and PhysicsAbstract The concept of graph labeling was introduced in the mid-1960s by Rosa. In this paper, we introduce a notion of graceful labeling of a finite poset. We obtain graceful labeling of some postes such as a chain, a fence, and a crown. In 2002 Thakare, Pawar, and Waphare introduced the `adjunct' operation of two lattices with respect to an adjunct ...
Ashok Bhavale, Dr. DEEPAK SHELKE*
openaire +2 more sources
International Journal of Engineering & Technology, 2018 A graph G with m vertices and n edges, is said to be prime graceful labeling, if there is an injection from the vertices of G to {1, 2, ..., k} where k = min {2m, 2n} such that gcd ( ( ), ( )=1 and the induced injective function from the edges of G to {1, 2, ..., k − 1} defined by ( ) = | ( ) − ( ) | , the resulting edge labels are distinct. In
T. Hameed Hassan, R. Mohammad Abbas
openaire +2 more sources