FAQ

Neighbourhood (graph theory)

Known as: Neighborhood (graph theory), Adjacent vertices, Adjacent vertex 
In graph theory, an adjacent vertex of a vertex v in a graph is a vertex that is connected to v by an edge. The neighbourhood of a vertex v in a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1972-2018
0204019722018

Related topics

Related topics

35 relations
Adjacency listAdjacency matrixBipartite double coverClaw-free graph
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Neighbourhood (graph theory)
Graph (discrete mathematics)
Graph theory
Planar graph
Conditional random field
Degree (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Augmented Eccentric Connectivity Index of Some Thorn Graph
The augmented eccentric connectivity index is defined as the summation of the quotients of the product of adjacent vertex degrees… (More)
Is this relevant?
2008
2008
On the adjacent vertex distinguishing total coloring numbers of graphs with Delta=3
 
Is this relevant?
2008
2008
On forbidden subdivision characterizations of graph classes
We provide a characterization of several graph parameters (the acyclic chromatic number, the arrangeability, and a sequence of… (More)
Is this relevant?
2007
2007
Adjacent Vertex Distinguishing Edge-Colorings
An adjacent vertex distinguishing edge-coloring of a simple graph G is a proper edge-coloring of G such that no pair of adjacent… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
1996
1996
Mutual Exclusion Scheduling
Mutual exclusion scheduling is the problem of scheduling unit-time tasks non-preemptively on m processors subject to constraints… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Acyclic Coloring of Graphs
A vertex coloring of a graph G is called acyclic if no two adjacent vertices have the same color and there is no two-colored… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A Unified Approach a Visibility Representation of Planar Graphs
We study visibility representations of graphs, which are constructed by mapping vertices to horizontal segments, and edges to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Vertex-to-vertex pursuit in a graph
A graph G is given and two players, a cop and a robber, play the folioking game: the cop chooses a vertex, then the robber… (More)
  • figure 1
Is this relevant?
Highly Cited
1973
Highly Cited
1973
Graph Puzzles, Homotopy, and the Alternating Group "
The so-called 15-puzzle may be generalized to a puzzle based on an arbitrary graph. We consider labelings or colorings of the… (More)
Is this relevant?