Graph Theory

  title={Graph Theory},
  author={John Adrian Bondy and Uppaluri S. R. Murty},
  booktitle={Graduate Texts in Mathematics},
  • J. Bondy, U. Murty
  • Published in Graduate Texts in Mathematics 14 August 2008
  • Computer Science
Graph theory is a flourishing discipline containing a body of beautiful and powerful theorems of wide applicability. Its explosive growth in recent years is mainly due to its role as an essential structure underpinning modern applied mathematics computer science, combinatorial optimization, and operations research in particular but also to its increasing application in the more applied sciences. The versatility of graphs makes them indispensable tools in the design and analysis of communication… 
An overview of the applications of graph theory in heterogeneous fields to some extent is given, which mainly focuses on the computer science applications that uses graph theoretical concepts and role of labeling in expanding the utility of this channel assignment process in communication networks.
Degree, Toughness and Subgraph Conditions for Hamiltonian Properties of Graphs
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an unordered pair of (not necessarily distinct) vertices. A graph can represent any set of objects
Generalized Ramsey numbers for graphs
This thesis contains new contributions to Ramsey theory, in particular results that establish exact values of graph Ramsey numbers that were unknown to date. Given two graphs F and H, the Ramsey
Graphs and Networks
The application of graphs and networks as mathematical models in social science, psychology, and linguistics has grown considerably in the last decades. Undirected and directed graphs are important
Spectra of Weighted Directed Graphs
The study of mixed graph and its Laplacian matrix have gained quite a bit of interest among the researchers. Mixed graphs are very important for the study of graph theory as they provide a setup
Studies in graph theory distance related concepts in graphs
By a graph G = (V,E), we mean a finite undirected graph with neither loops nor multiple edges. The order and size of G are denoted by n = |V | and m = |E| respectively. For graph theoretic
Subgraph conditions for Hamiltonian properties of graphs
The research that forms the basis of this thesis addresses the following general structural questions in graph theory: which fixed graph of pair of graphs do we have to forbid as an induced subgraph
Lucas graphs
Special number sequences play important role in many areas of science. One of them named as Fibonacci sequence dates back to 820 years ago. There is a lot of research on Fibonacci numbers due to
Contributions at the Interface Between Algebra and Graph Theory
In this thesis, we make some contributions at the interface between ‘algebra’ and ‘graph theory’. In Chapter 1, we give an overview of the topics and also the definitions and preliminaries. In