Affiliation:
1. Department of Mathematics, Faculty of Sciences, Razi University, Kermanshah, Iran
Abstract
A simple graph [Formula: see text] is called [Formula: see text]-bounded if for every two nonadjacent vertices [Formula: see text] of [Formula: see text] there exists a vertex [Formula: see text] such that [Formula: see text], where [Formula: see text] denotes the set of neighbors of the vertex [Formula: see text] in [Formula: see text]. In this paper, some properties of [Formula: see text]-bounded graphs are studied. It is shown that any bipartite [Formula: see text]-bounded graph is a complete bipartite graph with at most two horns; in particular, any [Formula: see text]-bounded tree is either a star or a two-star graph. Also, we prove that any non-end vertex of every [Formula: see text]-bounded graph is contained in either a triangle or a rectangle. Among other results, it is shown that all regular [Formula: see text]-bounded graphs are strongly regular graphs. Finally, we determine that how many edges can an [Formula: see text]-bounded graph have?
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics