Graph Theory with Applications

  title={Graph Theory with Applications},
  author={John Adrian Bondy and Uppaluri S. R. Murty},
Cooperative Caching in Fog Radio Access Networks: A Graph-based Approach
Simulation results show remarkable improvements in terms of offloaded traffic by using the proposed graph-based approach to cooperative caching, which has lower complexity than traditional approximate solutions.
Stream graphs and link streams for the modeling of interactions over time
This paper generalizes graph concepts to cope with both intrinsically temporal and structural nature of interactions, and obtains a language to directly deal with interactions over time, similar to the language provided by graphs to deal with relations.
  • F. Li
  • Mathematics, Computer Science
  • 2015
A recursive algorithm is given for computing the maximum and minimum isolated rupture degree of trees with given order and maximum degree, and the exact value of isolated rupturedegree of gear graphs are given.
The connectivity and minimum degree of circuit graphs of matroids
Let G be the circuit graph of any connected matroid M with minimum degree δ(G). It is proved that its connectivity κ(G) ≥ 2|E(M) − B(M)| − 2. Therefore δ(G) ≥ 2|E(M) − B(M)| − 2 and this bound is the
Bilinear Mixed Effects Models For Relations Between Universities
this article illustrates the use of linear and bilinear random effects models to represent statistical dependencies that often characterize dyadic data such as international relations. In particular,
DNA Encoding Method of Weight for Chinese Postman Problem
  • Aili Han, Daming Zhu
  • Computer Science, Physics
    2006 IEEE International Conference on Evolutionary Computation
  • 2006
We have devised a new DNA encoding method to represent numerical values and apply it to solve the Chinese postman problem, an instance of optimization problems on weighted graphs. For any a weighted,
On Connected [g,f +1]-Factors in Graphs
It is shown that every graph G, including both a [g,f]-factor and a hamiltonian path, contains a connected [ g,f +1]-factor, extending Kano's conjecture concerning the existence of connected [k,k+1]-factors in graphs.
Data transfers in networks
This paper solves the version of these authors as well as a more difficult version of this scheduling problem by formulating them as a continuous form of the Hakimi-Kariv-de Werra generalization of the edge-coloring problem in bipartite graphs.
[2,3]-factors in a 3-connected infinite planar graph
For two integersm, n withm<-n, an[m, n]-factorF in a graphG is a spanning subgraph ofG withm<-dF(v)<-n for allv∈V(F). In 1996, H. Enomoto et al. proved that every 3-connected planar graphG
A New Approximation Algorithm for Finding Heavy Planar Subgraphs
We provide the first nontrivial approximation algorithm for MAXIMUM WEIGHT PLANAR SUBGRAPH, the NP-hard problem of finding a heaviest planar subgraph in an edge-weighted graph G . This problem has


The binding number of a graph and its Anderson number
Some remarks on the theory of graphs
The present note consists of some remarks on graphs. A graph G is a set of points some of which are connected by edges. We assume here that no two points are connected by more than one edge. The
Some extremal problems in graph theory, in Combinatorial Theory and its Applications I (eds
  • P. Erdos, A. Renyi and V. T. Sos), North-Holland, Amsterdam, pp. 3.78-92
  • 1970
2, there exists no graph with the property that every pair of . vertices is connected by a unique path of length
  • Ie (A. Kotzig,
  • 1974
G'is hamiltonian if bind G ~3/2, and - that G contains atrian"gle if bind G:> to + J5)
  • 1973
Ein Dreifarbensatz fur dreikreisfreie Netze auf der Kugel
  • Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg. Math.-Nat. Reihe, 8, 109-19
  • 1958
The Four-Color Problem