The binding number of a graph and its Anderson number
نویسندگان
چکیده
منابع مشابه
The Binding Number of a Graph and Its Anderson Number*
The binding number of a graph G, bind(G), is defined; some examples of its calculation are given, and some upper bounds for it are proved. It is then proved that, if bind(G) > c, then G contains at least 1 G 1 c/(c + 1) disjoint edges if 0 < c < 3, at least ( G I (3c 2)/3c 2(c 1)/c disjoint edges if 1 < c < $, a Hamiltonian circuit if c > $, and a circuit of length at least 3(1 G / l)(c 1)/c if...
متن کاملThe relationship between the distinguishing number and the distinguishing index with detection number of a graph
This article has no abstract.
متن کاملUniform Number of a Graph
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
متن کاملThe binding number of a graph and its cliques
We consider the binding numbers of Kr-free graphs, and improve upper bounds on the binding number which force a graph to contain a clique of order r. For the case r = 4, we provide a construction for K4-free graphs which have a larger binding number than previously known constructions. This leads to a counterexample to a conjecture by Caro regarding the neighborhoods of independent sets.
متن کاملThe convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1973
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90038-5