Graph operations

Known as: Elementary graph operation, Graph edit operation, Unary graph operation 
Graph operations produce new graphs from initial ones. They may be separated into the following major categories.
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Graphs are common data structures for many applications, and efficient graph processing is a must for application performance… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2012
Highly Cited
2012
The ability to handle large scale graph data is crucial to an increasing number of applications. Much work has been dedicated to… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Graphs appear in numerous applications including cyber-security, the Internet, social networks, protein networks, recommendation… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2010
2010
Recently introduced Zagreb coindices are a generalization of classical Zagreb indices of chemical graph theory. We explore here… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
As the size of graphs for analysis continues to grow, methods of graph processing that scale well have become increasingly… (More)
Is this relevant?
2008
2008
Let G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal to the length of a shortest path that… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We use focal-species analysis to apply a graph-theoretic approach to landscape connectivity in the Coastal Plain of North… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Graphs are finite and handled as relational structures. We give some answers to the following general questions: (1) For which… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We state precise definitions of the basic notions of Sowa’s framework [Sowa 84] and provide related results. These results mainly… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?