Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,047,703 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.
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
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
2014
2014
Connective eccentric index of some graph operations
Nilanjan De
,
A. Pal
,
S. Nayeem
arXiv.org
2014
Corpus ID: 16301733
The connective eccentric index of a graph is a topological index involving degrees and eccentricities of vertices of the graph…
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
2010
2010
INDEX OF SOME GRAPH OPERATIONS
G. Fath-Tabar
,
A. Hamzeh
,
S. Hossein-Zadeh
2010
Corpus ID: 51771441
Let G = (V, E) be a graph. For e = uv ∈ E(G), nu(e) is the number of vertices of G lying closer to u than to v and nv(e) is the…
Expand
2008
2008
An Efficient Multi Join Algorithm Utilizing a Lattice of Double Indices
Hanan Ahmed Hossni Mahmoud Abd Alla
,
L. Al-Safadi
2008
Corpus ID: 7289034
(cid:3) Abstract — In this paper, a novel multi join algorithm to join multiple relations will be introduced. The novel algorithm…
Expand
2007
2007
The game of Take Turn
Kennan Shelton
2007
Corpus ID: 124938181
We introduce the game of Take Turn, a vertex-deletion game played with coins placed on vertices of a graph. A move is to remove a…
Expand
2004
2004
Graph Operations and Super Edge Connectivity
Zhao Zhang
2004
Corpus ID: 124643002
Many attractive network topologies can be obtained from graph operations. Super edge connectivity is an important measure of…
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