Intriguing Properties

Vivek S. Borkar (), Vladimir Ejov (), Jerzy A. Filar () and Giang T. Nguyen ()
Additional contact information
Vivek S. Borkar: IIT, Powai
Vladimir Ejov: Flinders University
Jerzy A. Filar: Flinders University
Giang T. Nguyen: Université libre de Bruxelles

Chapter Chapter 2 in Hamiltonian Cycle Problem and Markov Chains, 2012, pp 9-20 from Springer

Abstract: Abstract In this book, all graphs are connected and undirected, unless otherwise stated. We follow the graph terminology and conventions from Harary [57], where the reader can find an excellent introduction to graph theory. Consider a graph G = (V (G);E(G)) = (V, E), where V is the set of vertices of G, |V| = N, and E is the set of edges on G.

Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-3232-6_2

Ordering information: This item can be ordered from
http://www.springer.com/9781461432326

DOI: 10.1007/978-1-4614-3232-6_2

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().