Antimagic Total Dekomposisi Graf Helm dan untuk Pengembangan Ciphertext
A graph $G(V,E)$ has a $H$-Covering if every edge in $E$ belongs to a subgraph of $G$ isomorphic to $H$. The $(a,d)-H$ antimagic covering on the G graph is a biijective functin of $f:V(G)\cup E(G) \rightarrow \{1,2,...,|V(G)|+|E(G)|\}$ till all of the $H'$ subgraphs that isomorphic to H have we...
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Fformat: | Academic Paper |
| Cyhoeddwyd: |
2016-02-02T06:50:44Z.
|
| Pynciau: | |
| Mynediad Ar-lein: | Get Fulltext |
| Tagiau: |
Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|
Rhyngrwyd
Get Fulltext3rd Floor Main Library
| Rhif Galw: |
A1234.567 |
|---|---|
| Copi 1 | Ar gael |