Neighbourhood (graph theory)
Semantic Scholar uses AI to extract papers important to this topic.
The augmented eccentric connectivity index is defined as the summation of the quotients of the product of adjacent vertex degrees… (More)
We provide a characterization of several graph parameters (the acyclic chromatic number, the arrangeability, and a sequence of… (More)
- SIAM J. Discrete Math.
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)
We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The… (More)
Mutual exclusion scheduling is the problem of scheduling unit-time tasks non-preemptively on m processors subject to constraints… (More)
- Random Struct. Algorithms
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)
- Discrete & Computational Geometry
We study visibility representations of graphs, which are constructed by mapping vertices to horizontal segments, and edges to… (More)
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)
The so-called 15-puzzle may be generalized to a puzzle based on an arbitrary graph. We consider labelings or colorings of the… (More)