(a,d)-Edge-Antimagic Total Labelings of Caterpillars

Sugeng, Kiki Ariyanti; Miller, Mirka; Slamin, .; Bača, Martin

doi:10.1007/978-3-540-30540-8_19

Cited by 33 publications

(14 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Labeled graphs have valuable applications in various areas and have been investigated by many researchers too. We refer to [7] for a dynamic survey on graph labeling available online from the Electronic Journal of Combinatorics (see also, for instance, [36] and [37]). …”

Section: Introductionmentioning

confidence: 99%

A New Model for Classifying DNA Code Inspired by Neural Networks and FSA

Kang

Kelarev

Sale

et al. 2006

Advances in Knowledge Acquisition and Management

View full text Add to dashboard Cite

Abstract. This paper introduces a new model of classifiers CL(V, E, , r) designed for classifying DNA sequences and combining the flexibility of neural networks and the generality of finite state automata. Our careful and thorough verification demonstrates that the classifiers CL(V, E, , r) are general enough and will be capable of solving all classification tasks for any given DNA dataset. We develop a minimisation algorithm for these classifiers and include several open questions which could benefit from contributions of various researchers throughout the world.

show abstract

Section: Introductionmentioning

confidence: 99%

A New Model for Classifying DNA Code Inspired by Neural Networks and FSA

Kang

Kelarev

Sale

et al. 2006

Advances in Knowledge Acquisition and Management

View full text Add to dashboard Cite

show abstract

“…Properties of finite fields make it possible to consider combinatorial conditions for the labeling. We refer to [1][2][3]25,26,29,30,[37][38][39][40][41][42], for recent results on combinatorial properties of labelings. This motivates the following open question.…”

Section: Algorithmmentioning

confidence: 99%

Algorithms for computing parameters of graph-based extensions of BCH codes

Kelarev

2007

Journal of Discrete Algorithms

View full text Add to dashboard Cite

show abstract

“…In particular, stars [21], path-like trees [3] banana trees [9,23] w-trees [10], extended w-trees [11,14,15], subdivided stars [12,13,16], caterpillars [22], subdivided caterpillars [17], disjoint union of caterpillars [4], subdivided w-trees [13,16], fire crackers and unicyclic graphs [23] …”

Section: Introductionmentioning

confidence: 99%