Results 201 to 210 of about 848 (243)

A digital twin and deep-learning ensemble for cyber attack detection in industrial control systems at the IoT edge. [PDF]

Sci Rep
Sayghe A, Alahmadi MD, Gharawi AA.
europepmc   +1 more source

Helmkit: fast and robust conversion of HELM notation to atomistic representations for large-scale macromolecular informatics. [PDF]

J Cheminform
Adàlia R, Sanjuan G, Margalef T, Zamora I.   +3 more
europepmc   +1 more source

HyMSS-GAD: a hybrid multi-stage framework for multi-view graph anomaly detection with structural, contextual, and geometric reasoning. [PDF]

Sci Rep
Khan W, Ebrahim N, Elloumi M, Brahim K.
europepmc   +1 more source

The χ -Binding Function of <i>d</i>-Directional Segment Graphs. [PDF]

Discrete Comput Geom
Duraj L, Kang RJ, La H, Narboni J, Pokrývka F, Rambaud C, Reinald A.   +6 more
europepmc   +1 more source

Graceful disconnected graphs

, 1979
Cohen, A.M., Goebel, F.
openaire   +1 more source

Edge - Odd Graceful Graphs

Electronic Notes in Discrete Mathematics, 2009
Abstract Graph labeling of a graph was introduced by Rosa [A. Rosa, “Theory of graphs” (International Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris (1967) 349-355] and the concept of an edge graceful labeling was introduced by Lo [S. Lo, “On edge graceful labeling of graphs”, Congress Numer., 50(1985) 231-241]. We introduced a
A Solairaju
exaly   +2 more sources

Graceful Centers of Graceful Graphs and Universal Graceful Graphs [PDF]

Proyecciones, 2019
In this paper we define graceful center of a graceful graph. We proved any graph G which admits α-labeling has at least four graceful centers. We also defined a new strong concept of universal graceful graph. Some results on ring sum of two graphs for their graceful labeling are proved.
H. M. Makadia, H. M. Karavadiya, V. J. Kaneria   +2 more
exaly   +4 more sources

Super Total Graceful Graphs

Electronic Notes in Discrete Mathematics, 2015
Abstract A total graceful labeling (TGL) of a ( p , q ) graph G is a bijection f from V ( G ) ∪ E ( G ) to the set { 1 , 2 , 3 , … , p + q } so that f ( u v ) = | f ( u ) − f ( v ) | for all u v ∈ E ( G ) . A TGL is called a super if f ( E ) = { 1 , 2 , 3 , … ,
S. P. Subbiah, J. Pandimadevi, R. Chithra   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On Graceful Directed Graphs

SIAM Journal on Algebraic Discrete Methods, 1985
This very interesting paper introduces the concept of graceful directed graphs as follows. A digraph D with e arcs is numbered by assigning a distinct integer value h(v) from \(\{\) 0,1,...,e\(\}\) to each node v. Each arc (u,v) receives a value \(h(u,v)=h(v)-h(u)\) (mod e\(+1)\).
Bloom, G. S., Hsu, D. F.
openaire   +1 more source