نتایج جستجو برای: independence number
تعداد نتایج: 1202354 فیلتر نتایج به سال:
Let~$G$ be a simple undirected graph. A broadcast on~$G$ is a function $f : V(G)\rightarrow\NNNNN$ such that $f(v)\le e_G(v)$ holds for every vertex~$v$ of~$G$, where $e_G(v)$ denotes the eccentricity of~$v$ in~$G$, is, maximum distance from~$v$ to any other vertex of~$G$. The cost of~$f$ is value $\cost(f)=\sum_{v\in V(G)}f(v)$. A broadcast~$f$ independent if two distinct vertices $u$ an...
After 2-crossing-critical graphs were characterized in 2016, their most general subfamily, large 3-connected graphs, has attracted separate attention. This paper presents sharp upper and lower bounds for domination independence number.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید