Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,794,577 papers from all fields of science
Search
Sign In
Create Free Account
Graph operations
Known as:
Elementary graph operation
, Graph edit operation
, Unary graph operation
Expand
Graph operations produce new graphs from initial ones. They may be separated into the following major categories.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Cograph
Complement graph
Dual graph
Edge contraction
Expand
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
Yuan-Yu Tsai
,
Yushiou Tsai
,
I-Ting Chi
,
Chi-Shiang Chan
Symmetry
2018
Corpus ID: 53568606
The study proposed a vertex-based authentication algorithm based on spatial subdivision. A binary space partitioning tree was…
Expand
2015
2015
Intelligent agent for web watching: language and belief system
Kolonin Anton Germanovich
2015
Corpus ID: 215904389
In this paper we describe pre-requisites for development of an intelligent computer software agent for watching information on…
Expand
Review
2015
Review
2015
CONVEXITY OF MINIMAL DOMINATING AND TOTAL DOMINATING FUNCTIONS OF CORONA PRODUCT GRAPH OF A PATH WITH A STAR
M. Parvathi
,
B. Maheswari
2015
Corpus ID: 212551917
‘Domination in graphs’ has been studied extensively and at present it is an emerging area of research in graph theory. An…
Expand
2014
2014
On the parameterized vertex cover problem for graphs with perfect matching
Jian-xin Wang
,
Wenjun Li
,
Shaohua Li
,
Jianer Chen
Science China Information Sciences
2014
Corpus ID: 16256624
A vertex cover of an n-vertex graph with perfect matching contains at least n/2 vertices. In this paper, we study the…
Expand
Review
2013
Review
2013
MINIMAL DOMINATING FUNCTIONS OF CORONA PRODUCT GRAPH OF A CYCLE WITH A COMPLETE GRAPH
A. Pradesh
2013
Corpus ID: 124179412
‘Domination in graphs’ is the fastest growing area in Graph Theory that has emerged rapidly in the last three decades. An…
Expand
2010
2010
Graph operations and cordiality
M. Youssef
,
E. A. Elsakhawi
Ars Comb.
2010
Corpus ID: 41162471
In this paper, we show that the disjo int union of two cordial graphs one of them is of even size is cordi al and the join of two…
Expand
2009
2009
An affirmative answer to a problem posed by Z\u alinescu
Liangjin Yao
2009
Corpus ID: 115163928
Recently, in [5] Zalinescu posed a question about the characterization of the intrinsic core of the Minkowski sum of two graphs…
Expand
2002
2002
Perceptual Organization Based Computational Model for Robust Segmentation of Moving Objects
Sudeep Sarkar
,
Daniel Majchrzak
,
Kishore Korimilli
Computer Vision and Image Understanding
2002
Corpus ID: 5121752
The role of perceptual organization in motion analysis has heretofore been minimal. In this work we present a simple but powerful…
Expand
1999
1999
Packing and covering the complete graph with cubes
Peter Adams
,
D. Bryant
,
S. El-Zanati
The Australasian Journal of Combinatorics
1999
Corpus ID: 18105620
A decomposition of K \L, the complete graph of order n with a subgraph L (called the leave) removed, into edge disjoint copies of…
Expand
1989
1989
Effective Resource Utilization for Multiprocessor Join Execution
M. C. Murphy
,
D. Rotem
Very Large Data Bases Conference
1989
Corpus ID: 2655580
Conventional approaches to execution of database queries on general purpose multiprocessors attempt to maximize system throughput…
Expand