Fibonacci Graphs and their Expressions
Data Structures and Algorithms
2013-05-14 v1 Combinatorics
Abstract
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a Fibonacci graph which gives a generic example of non-series-parallel graphs. Our intention in this paper is to simplify the expressions of Fibonacci graphs and eventually find their shortest representations. With that end in view, we describe the number of methods for generating Fibonacci graph expressions and carry out their comparative analysis.
Keywords
Cite
@article{arxiv.1305.2647,
title = {Fibonacci Graphs and their Expressions},
author = {Mark Korenblit and Vadim E. Levit},
journal= {arXiv preprint arXiv:1305.2647},
year = {2013}
}
Comments
39 pages