<p>I think your question falls in the context of "graph operators". A graph operator $S$ is just a map from the class of graphs to the class of graphs, and you then have a sequence $G$, $S(G)$, $S^2(G)$, etc. </p>

<p>I do not think that there could possibly be a general way to determine $S^n(G)$ as a function of $n$ and $G$ that could work for all $S$, even for a fixed $S$. For example, if $S(G)$ is the intersection graph of the maximal cliques of $G$ (considered in Harary's book and denoted by $K$), then what you ask is known for only a handful of families, including the complements of $nK_2$, the locally $C_6$ graphs and the so called "clockwork graphs".</p>

<p>Many other graph operators are studied in the book "Graph Dynamics" by Erich Prisner.</p>

CC BY-SA 3.0
2012-05-04T14:10:48.783Z
2012-05-04T14:10:48.783Z
rvf0068
<p>Let there be a sequence of graphs <span class="math-container">$G_1, G_2, G_3, ...$</span> constructed using some particular approach or algorithm. in this particular case <span class="math-container">$G_n$</span> is constructed by modifying <span class="math-container">$G_{n-1}$</span> in some &quot;systematic&quot; way. in this particular case <span class="math-container">$G_n$</span> is &quot;more complex&quot; than <span class="math-container">$G_{n-1}$</span> and generally has more edges/vertices.</p>
<h3>Question:</h3>
<p>What is some systematic method of determining the &quot;basic differences&quot; between <span class="math-container">$G_n$</span> and <span class="math-container">$G_{n-1}$</span>?  In some sense, how does one derive a &quot;recurrence relation&quot; like a formula that derives <span class="math-container">$G_n$</span> from <span class="math-container">$G_{n-1}$</span> (similar to [1] but instead of using integers as parameters, here with graphs as the parameters)?  What are some famous examples of graph sequences like this, successfully analyzed in the literature?</p>
<p>Presumably this general question is undecidable for some contrived cases [exercise for reader] but is decidable for special cases.  I am interested in the subset of decidable cases.</p>
<h3>Background</h3>
<p>This is an old problem that first occurred to me about 2 decades ago which to my knowledge has not been studied too much in particular but which seems significant.  I have a particular algorithm in mind for generating <span class="math-container">$G_n$</span> from <span class="math-container">$G_{n-1}$</span> for which I suspect there is not much research (hint, see other question [2]), and might mention/further clarify at a later date; but for now I am interested in a more general approach.</p>
<p>Another analogy would be with textual &quot;diff&quot; programs which find lines added, deleted, modified between two text files.  Is there an analogous approach for graphs that has been used somewhere?  Actually, I suspect this type of construction is somewhat widespread in graph theory proofs, maybe even key/famous ones, but not necessarily studied so much in isolation.</p>
<p>In the best case scenario, there would be a software package that would actually successfully derive such formulas in some cases, but to my knowledge it does not exist right now.</p>
<p>[1] <a href="http://en.wikipedia.org/wiki/Recurrence_relation" rel="nofollow noreferrer">solving recurrence relations, wikipedia </a></p>
<p>[2] <a href="https://cstheory.stackexchange.com/questions/10739/largest-language-class-for-which-inclusion-is-decidable">largest language class for which inclusion is decidable</a></p>

CC BY-SA 3.0
2012-04-19T05:56:52.260Z
google for "dynamic complexity theory" and "dynamic descriptive complexity".
Kaveh
<ds.algorithms><reference-request><graph-theory><co.combinatorics><graph-algorithms>
techniques or examples of analyzing a series of graphs
vzn
# techniques or examples of analyzing a series of graphs

(Asked by: username_0 on 2012-04-19)

Let there be a sequence of graphs $G\_1, G\_2, G\_3, ...$ constructed using some particular approach or algorithm. in this particular case $G\_n$ is constructed by modifying $G\_{n-1}$ in some "systematic" way. in this particular case $G\_n$ is "more complex" than $G\_{n-1}$ and generally has more edges/vertices.

### Question:

What is some systematic method of determining the "basic differences" between $G\_n$ and $G\_{n-1}$? In some sense, how does one derive a "recurrence relation" like a formula that derives $G\_n$ from $G\_{n-1}$ (similar to [1] but instead of using integers as parameters, here with graphs as the parameters)? What are some famous examples of graph sequences like this, successfully analyzed in the literature?

Presumably this general question is undecidable for some contrived cases [exercise for reader] but is decidable for special cases. I am interested in the subset of decidable cases.

### Background

This is an old problem that first occurred to me about 2 decades ago which to my knowledge has not been studied too much in particular but which seems significant. I have a particular algorithm in mind for generating $G\_n$ from $G\_{n-1}$ for which I suspect there is not much research (hint, see other question [2]), and might mention/further clarify at a later date; but for now I am interested in a more general approach.

Another analogy would be with textual "diff" programs which find lines added, deleted, modified between two text files. Is there an analogous approach for graphs that has been used somewhere? Actually, I suspect this type of construction is somewhat widespread in graph theory proofs, maybe even key/famous ones, but not necessarily studied so much in isolation.

In the best case scenario, there would be a software package that would actually successfully derive such formulas in some cases, but to my knowledge it does not exist right now.

[1] [solving recurrence relations, wikipedia](http://en.wikipedia.org/wiki/Recurrence_relation)

[2] [largest language class for which inclusion is decidable](https://cstheory.stackexchange.com/questions/10739/largest-language-class-for-which-inclusion-is-decidable)

**Tags:** ds.algorithms, reference-request, graph-theory, co.combinatorics, graph-algorithms

> **Comments:**
> **username_1**: google for "dynamic complexity theory" and "dynamic descriptive complexity".  

---

## 1 answers

### Answer by username_2 on 2012-05-04. Score: 3 | Accepted answer

I think your question falls in the context of "graph operators". A graph operator $S$ is just a map from the class of graphs to the class of graphs, and you then have a sequence $G$, $S(G)$, $S^2(G)$, etc.

I do not think that there could possibly be a general way to determine $S^n(G)$ as a function of $n$ and $G$ that could work for all $S$, even for a fixed $S$. For example, if $S(G)$ is the intersection graph of the maximal cliques of $G$ (considered in Harary's book and denoted by $K$), then what you ask is known for only a handful of families, including the complements of $nK\_2$, the locally $C\_6$ graphs and the so called "clockwork graphs".

Many other graph operators are studied in the book "Graph Dynamics" by Erich Prisner.


---

