𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Codings of graphs with binary edge labels

✍ Scribed by Martin Aigner; Eberhard Triesch

Publisher
Springer Japan
Year
1994
Tongue
English
Weight
424 KB
Volume
10
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recursive neural networks for processing
Recursive neural networks for processing graphs with labelled edges: theory and applications
✍ M. Bianchini; M. Maggini; L. Sarti; F. Scarselli 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 393 KB

In this paper, we introduce a new recursive neural network model able to process directed acyclic graphs with labelled edges. The model uses a state transition function which considers the edge labels and is independent both from the number and the order of the children of each node. The computation

Binary coding of algebraic Kekulé struct
Binary coding of algebraic Kekulé structures of catacondensed benzenoid graphs
✍ Damir Vukičević; Petra Žigert 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 282 KB

The algebraic Kekulé structure of a finite catacondensed benzenoid graph with h hexagons is described by a binary code of length h. The procedure can be reversed, any (algebraic) Kekulé structure can be recovered from its binary code.

Alternating walks in partially 2-edge-co
Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling
✍ AndréE. Kézdy; Chi Wang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 292 KB

A graph is partially 2-edge-colored if edges of G are colored by two colors, possibly with some edges uncolored. A walk is alternating in a partially 2-edge-colored graph if the given 2edge-coloring can be extended to all edges of G such that colors alternate as the walk is traversed. We present a p