Bootstrap percolation and diffusion in random graphs with given vertex degrees.
Borsuk-Ulam type theorems
A generalization of the theorem of Bajmóczy and Bárány which in turn is a common generalization of Borsuk's and Radon's theorem is presented. A related conjecture is formulated.
Bottom Schur functions.
Bound graph polysemy.
Boundary domination in graphs
Boundary of the union of rectangles in the plane
Given rectangles in a plane whose all sides belong to two perpendicular directions, an algorithm for the construction of the boundary of the union of those rectangles is shown in teh paper.
Bounded expansion in web graphs
In this paper we study various models for web graphs with respect to bounded expansion. All the deterministic models even have constant expansion, whereas the copying model has unbounded expansion. The most interesting case turns out to be the preferential attachment model --- which we conjecture to have unbounded expansion, too.
Bounded-degree graphs can have arbitrarily large slope numbers.
Bounded-degree graphs have arbitrarily large geometric thickness.
Bounding neighbor-connectivity of Abelian Cayley graphs
For the notion of neighbor-connectivity in graphs whenever a vertex is subverted the entire closed neighborhood of the vertex is deleted from the graph. The minimum number of vertices whose subversion results in an empty, complete, or disconnected subgraph is called the neighbor-connectivity of the graph. Gunther, Hartnell, and Nowakowski have shown that for any graph, neighbor-connectivity is bounded above by κ. Doty has sharpened that bound in abelian Cayley graphs to approximately (1/2)κ. The...
Bounding the complexity of simplicial group actions on trees.
Bounding the number of edges in permutation graphs.
Bounding the partition function of spin-systems.
Bounding the Rank of Certain Permutation Groups.
Bounds and inequalities for the Perron root of a nonnegative matrix. III: Bounds dependent on simple paths and circuits.
Bounds concerning the alliance number
P. Kristiansen, S. M. Hedetniemi, and S. T. Hedetniemi, in Alliances in graphs, J. Combin. Math. Combin. Comput. 48 (2004), 157–177, and T. W. Haynes, S. T. Hedetniemi, and M. A. Henning, in Global defensive alliances in graphs, Electron. J. Combin. 10 (2003), introduced the defensive alliance number , strong defensive alliance number , and global defensive alliance number . In this paper, we consider relationships between these parameters and the domination number . For any positive integers...
Bounds for graph expansions via elasticity.
Bounds for index of a modified graph
If a graph is connected then the largest eigenvalue (i.e., index) generally changes (decreases or increases) if some local modifications are performed. In this paper two types of modifications are considered: (i) for a fixed vertex, t edges incident with it are deleted, while s new edges incident with it are inserted; (ii) for two non-adjacent vertices, t edges incident with one vertex are deleted, while s new edges incident with the other vertex are inserted. ...
Bounds for on-line selection
Bounds for orthogonal 3-D graph drawing.