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...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Academic Paper |
| 出版: |
2016-02-02T06:50:44Z.
|
| 主题: | |
| 在线阅读: | Get Fulltext |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
成为第一个发表评论!