Bartholdi zeta functions of fractal graphs.
Bass and Serre theory and Nielsen transformations (free and free product case)
Binary Polyhedral Groups and Euclidean Diagrams.
Bipartite diametrical graphs of diameter 4 and extreme orders.
Bipartite-uniform hypermaps on the sphere.
Biplanes.
Biregular edge-symmetric graphs
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 Rank of Certain Permutation Groups.
Bounds on the distinguishing chromatic number.