Results 21 to 30 of about 97 (73)
AN ALGORITHM FOR ODD GRACEFULNESS OF THE TENSOR PRODUCT OF TWO LINE GRAPHS [PDF]
An odd graceful labeling of a graph G = (V E, ) is a function f V G E G : ( ) {0,1,2, . . .2 ( ) 1} → − such that | ( ) ( )| f u f v − is odd value less than or equal to 2 ( ) 1 E G − for any , ( ) u v V G ∈ .
M. Ibrahim Moussa
core +1 more source
Special Graceful Labelings of Irregular Fences and Lobsters
Irregular fences are subgraphs of $P_m \times P_n$ formed with $m$ copies of $P_n$ in such a way that two consecutive copies of $P_n$ are connected with one or two edges; if two edges are used, then they are located in levels separated an odd number of ...
Christian Barrientos
doaj +1 more source
Divergent Synthesis of Möbius and Hückel N‐Heterocycloarenes From a Common Macrocyclic Backbone
In the divergent synthesis of Möbius and Hückel N‐heterocycloarenes from a common macrocyclic precursor, the annulation reaction dictates topology: Scholl reaction gives Möbius topology, while InCl3‐mediated alkyne annulation gives Hückel topology. The Möbius N‐heterocycloarene is unevenly contorted as revealed by crystal structure, and the Hückel N ...
Han Chen +6 more
wiley +2 more sources
Odd Graceful Labeling Of Tensor Product of Some Graphs [PDF]
(G);E(G)) with p vertices and q edges, if there exists an injectionfunction : V (G) ! f0; 1; 2; ; 2q ô€€€ 1g with each edge uv assignedthe label jf(u)ô€€€f(v)j, the resulting edge labels are f1; 3; 5; ; 2qô€€€1g.The tensor product of two graphs, G and H,
G. N. Purohit +2 more
core +1 more source
E-cordial Labeling for Cartesian Product of Some Graphs [PDF]
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 +2 more sources
Graphs with edge-odd graceful labelings
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
International Journal of Mathematical Combinatorics, Vol.7 [PDF]
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
Kinetic Contribution to the Arbitrary Order Odd Frequency Moments of the Dynamic Structure Factor
ABSTRACT An exact expression is derived for the kinetic contribution to the odd (arbitrary order) frequency moments of the dynamic structure factor via a finite summation that features averages of even (all lower orders) powers of the momentum over the exact momentum distribution.
Panagiotis Tolias +2 more
wiley +1 more source
This publication describes how R. B. Woodward and Roald Hoffmann crafted their masterpiece publications. Illustrations include Woodward's first draft of the famous “Violations There are none. Nor can violations be expected of so fundamental a principle of maximum bonding.” Original but discarded text shows the stepwise paths toward the W‐H masterpieces.
Jeffrey I. Seeman
wiley +1 more source
Becoming Dostoevsky (how Rowan Williams opens up Bakhtin)
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

