Skip to search formSkip to main contentSkip to account menu

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 (opens in a new tab)

Related topics

Related topics

18 relations
CographComplement graphDual graphEdge contraction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Vertex-Based 3D Authentication Algorithm Based on Spatial Subdivision
The study proposed a vertex-based authentication algorithm based on spatial subdivision. A binary space partitioning tree was… 
2015
2015
Intelligent agent for web watching: language and belief system
In this paper we describe pre-requisites for development of an intelligent computer software agent for watching information on… 
Review
2015
Review
2015
CONVEXITY OF MINIMAL DOMINATING AND TOTAL DOMINATING FUNCTIONS OF CORONA PRODUCT GRAPH OF A PATH WITH A STAR
‘Domination in graphs’ has been studied extensively and at present it is an emerging area of research in graph theory. An… 
Review
2013
Review
2013
MINIMAL DOMINATING FUNCTIONS OF CORONA PRODUCT GRAPH OF A CYCLE WITH A COMPLETE GRAPH
‘Domination in graphs’ is the fastest growing area in Graph Theory that has emerged rapidly in the last three decades. An… 
2013
2013
Faster Parameterized Algorithms for Deletion to Split Graphs
An undirected graph is said to be split if its vertex set can be partitioned into two sets such that the subgraph induced on one… 
2009
2009
An affirmative answer to a problem posed by Z\u alinescu
Recently, in [5] Zalinescu posed a question about the characterization of the intrinsic core of the Minkowski sum of two graphs… 
2008
2008
An Efficient Multi Join Algorithm Utilizing a Lattice of Double Indices
(cid:3) Abstract — In this paper, a novel multi join algorithm to join multiple relations will be introduced. The novel algorithm… 
2002
2002
Perceptual Organization Based Computational Model for Robust Segmentation of Moving Objects
The role of perceptual organization in motion analysis has heretofore been minimal. In this work we present a simple but powerful… 
1999
1999
Packing and covering the complete graph with cubes
A decomposition of K \L, the complete graph of order n with a subgraph L (called the leave) removed, into edge disjoint copies of… 
1989
1989
Effective Resource Utilization for Multiprocessor Join Execution
Conventional approaches to execution of database queries on general purpose multiprocessors attempt to maximize system throughput… 
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)