๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

DDR Graphs of Diameter Three

โœ Scribed by Medha Huilgol; H.B. Walikar; B.D. Acharya

Book ID
104444406
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
71 KB
Volume
15
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Antipodal graphs of diameter three
Antipodal graphs of diameter three
โœ A. Gardiner ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 290 KB
Pebbling Graphs of Diameter Three and Fo
Pebbling Graphs of Diameter Three and Four
โœ Luke Postle; Noah Streib; Carl Yerger ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 692 KB
Maximum pebbling number of graphs of dia
Maximum pebbling number of graphs of diameter three
โœ Boris Bukh ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB ๐Ÿ‘ 1 views

## Abstract Given a configuration of pebbles on the vertices of a graph __G__, a __pebbling move__ consists of taking two pebbles off some vertex __v__ and putting one of them back on a vertex adjacent to __v__. A graph is called __pebbleable__ if for each vertex __v__ there is a sequence of pebbli

On 3--vertex critical graphs of diameter
On 3--vertex critical graphs of diameter three
โœ Mustapha Chellali; Nader Jafari Rad; Abdollah Khodkar ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 354 KB