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)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Nilanjan De
- 2012

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

2008

- Zdenek Dvorak
- Eur. J. Comb.
- 2008

We provide a characterization of several graph parameters (the acyclic chromatic number, the arrangeability, and a sequence ofâ€¦Â (More)

Is this relevant?

2007

2007

- Paul N. Balister, Ervin GyÃ¶ri, JenÃ¶ Lehel, Richard H. Schelp
- SIAM J. Discrete Math.
- 2007

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)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Jun Sun, Stephen P. Boyd, Lin Xiao, Persi Diaconis
- SIAM Review
- 2006

We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. Theâ€¦Â (More)

Is this relevant?

1996

1996

- Brenda S. Baker, Edward G. Coffman
- Theor. Comput. Sci.
- 1996

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

- Noga Alon, Colin McDiarmid, Bruce A. Reed
- Random Struct. Algorithms
- 1991

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

- Roberto Tamassia, Ioannis G. Tollis
- Discrete & Computational Geometry
- 1986

We study visibility representations of graphs, which are constructed by mapping vertices to horizontal segments, and edges toâ€¦Â (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- Richard J. Nowakowski, Peter Winkler
- Discrete Mathematics
- 1983

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)

Is this relevant?

Highly Cited

1973

Highly Cited

1973

- RICHARD M. WILSOX, Alan J. Hoffman
- 1973

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?