On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

Separation index of graphs and stacked 2-spheres

In 1987, Kalai proved that stacked spheres of dimension d >= 3 are characterised by the fact that they attain equality in Barnette's celebrated Lower Bound Theorem. This result does not extend to dimension d = 2. In this article, we give a characterisation of stacked 2-spheres using what we call the separation index. Namely, we show that the separation index of a triangulated 2-sphere is maximal if and only if it is stacked. In addition, we prove that, amongst all n-vertex triangulated 2-spheres, the separation index is minimised by some n-vertex flag sphere for n >= 6. Furthermore, we apply this characterisation of stacked 2-spheres to settle the outstanding 3-dimensional case of the Lutz-Sulanke-Swartz conjecture that ``tight-neighbourly triangulated manifolds are tight''. For dimension d >= 4, the conjecture has already been proved by Effenberger following a result of Novik and Swartz. (C) 2015 Elsevier Inc. All rights reserved.

Upper bound on cubicity in terms of boxicity for graphs of low chromatic number

The boxicity (respectively cubicity) of a graph G is the least integer k such that G can be represented as an intersection graph of axis-parallel k-dimensional boxes (respectively k-dimensional unit cubes) and is denoted by box(G) (respectively cub(G)). It was shown by Adiga and Chandran (2010) that for any graph G, cub(G) <= box(G) log(2) alpha(G], where alpha(G) is the maximum size of an independent set in G. In this note we show that cub(G) <= 2 log(2) X (G)] box(G) + X (G) log(2) alpha(G)], where x (G) is the chromatic number of G. This result can provide a much better upper bound than that of Adiga and Chandran for graph classes with bounded chromatic number. For example, for bipartite graphs we obtain cub(G) <= 2(box(G) + log(2) alpha(G)] Moreover, we show that for every positive integer k, there exist graphs with chromatic number k such that for every epsilon > 0, the value given by our upper bound is at most (1 + epsilon) times their cubicity. Thus, our upper bound is almost tight. (c) 2015 Elsevier B.V. All rights reserved.

Formulas, tables, and graphs for trapezoidal reinforced concrete beams

Not available.

Graphs and Groups

This project is a combination of graphs and group theory in which the aim is to describe the automorphism group of some specific families of graphs. Finally, an example of the application of automorphism groups in reaction graphs is shown. The project is written in english.

Efficiency, energy and stoichiometry in pelagic food webs; reciprocal roles of food quality and food quantity

In most lakes, zooplankton production is constrained by food quantity, but frequently high C:P poses an additional constraint on zooplankton production by reducing the carbon transfer efficiency from phytoplankton to zooplankton. This review addresses how the flux of matter and energy in pelagic food webs is regulated by food quantity in terms of C and its stoichiometric quality in terms of C:P. Increased levels of light, CO2 and phosphorus could each increase seston mass and, hence, food quantity for zooplankton, but while light and CO2 each cause increased C:P (i.e. reduced food quality for herbivores), increased P may increase seston mass and its stoichiometric quality by reducing C:P. Development of food quality and food quantity in response to C- or P-enrichments will differ between 'batch-type' lakes (dominated by one major, seasonal input of water and nutrients) and 'continuous-culture' types of lakes with a more steady flow-rate of water and nutrients. The reciprocal role of food quantity and stoichiometric quality will depend strongly on facilitation via grazing and recycling by the grazers, and this effect will be most important in systems with low renewal rates. At high food abundance but low quality, there will be a 'quality starvation' in zooplankton. From a management point of view, stoichiometric theory offers a general tool-kit for understanding the integrated role of C and P in food webs and how food quantity and stoichiometric quality (i.e. C:P) regulate energy flow and trophic efficiency from base to top in food webs.From a management point of view, stoichiometric theory offers a general tool-kit for understanding the integrated role of C and P in food webs and how food quantity and stoichiometric quality (i.e. C:P) regulate energy flow and trophic efficiency from base to top in food webs.