Skip to search formSkip to main contentSkip to account menu

Periodic graph (graph theory)

Known as: Graph dynamics, Periodic Graphs (Graph Theory), Periodic graph 
In graph theory, a branch of mathematics, a periodic graph with respect to an operator F on graphs is one for which there exists an integer n > 0… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Complement graphGraph isomorphismGraph theory

Broader (1)

Graph operations

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Visualizing Temporal Graphs using Visual Rhythms - A Case Study in Soccer Match Analysis
In several applications, a huge amount of graph data have been generated, demanding the creation of appropriate tools for graph… 
2016
2016
Investigative simulation: Towards utilizing graph pattern matching for investigative search
This paper proposes the use of graph pattern matching for investigative graph search, which is the process of searching for and… 
2015
2015
The many faces of graph dynamics
The topological structure of complex networks has fascinated researchers for several decades, resulting in the discovery of many… 
2015
2015
Dynamic Graph Visualization with Multiple Visual Metaphors
Visualizing dynamic graphs is challenging due to the many data dimensions to be displayed such as graph vertices and edges with… 
2010
2010
Local Statistics of Realizable Vertex Models
We study planar “vertex” models, which are probability measures on edge subsets of a planar graph, satisfying certain constraints… 
2009
2009
Matrix Graph Grammars as a Model of Computation
Matrix Graph Grammars (MGG) is a novel approach to the study of graph dynamics ([15]). In the present contribution we look at MGG… 
2002
2002
The 3-path-step operator on trees and unicyclic graphs
E.Prisner in his book Graph Dynamics defines the k-path-step operator on the class of finite graphs. The k-path-step operator… 
2001
2001
On the homotopy type of the clique graph
If G is a graph, its clique graph K(G) is the intersection graph of all its (maximal) cliques. The complex G­ of a graph G is the… 
2000
2000
Discrete Floorplanning by Multidimensional Pattern Matching
In this paper, we show a new approach for solving discrete floo rplanning problems. Modules to be placed and the target… 
1991
1991
Recognizing strong connectivity in (dynamic) periodic graphs and its relation to integer programming
In this paper we develop an efficient algorithm to determine the strongly connected components of a (dynamic) periodic graph. A… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)