نتایج جستجو برای: distance degrees of vertices
تعداد نتایج: 21179886 فیلتر نتایج به سال:
Rosenbloom and Tsfasman introduced a new metric (RT metric) which is a generalization of the Hamming metric. In this paper we study the distance graphs of spaces Zn q and Sn with Rosenbloom -Tsfasman metric. We also describe the degrees of vertices, components and the chromatic number of these graphs. Distance graphs of general direct product spaces also described.
the chromatic number of a graph g, denoted by χ(g), is the minimum number of colors such that g can be colored with these colors in such a way that no two adjacent vertices have the same color. a clique in a graph is a set of mutually adjacent vertices. the maximum size of a clique in a graph g is called the clique number of g. the turán graph tn(k) is a complete k-partite graph whose partition...
a set $s$ of vertices in a graph $g=(v,e)$ is called a total$k$-distance dominating set if every vertex in $v$ is withindistance $k$ of a vertex in $s$. a graph $g$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (g - x) < gamma_{t}^{k}(g)$ for any vertex $xin v(g)$. in this paper,we investigate some results on total $k$-distance domination-critical of graphs.
The topological indices, defined as the sum of contributions of all pairs of vertices (among which are the Wiener, Harary, hyper–Wiener indices, degree distance, and many others), are expressed in terms of contributions of edges and pairs of edges.
We obtain a transference bound for vertices of corner polyhedra that connects two well-established areas research: proximity and sparsity solutions to integer programs. In the knapsack scenario, it implies any vertex ${x}^*$ an feasible polytope ${P}({a}, { b})=\{{x} \in {\mathbb R}^n_{\ge 0}: {a}^\top{x}={ b}\}$, ${a}\in Z}^n_{>0}$, there exists point ${z}^*\in {P}({a}, b})$ such that, denotin...
the first extended zeroth-order connectivity index of a graph g is defined as 0 1/2 1 ( ) ( ) , v v v g g d where v (g) is the vertex set of g, and v d is the sum of degrees of neighbors of vertex v in g. we give a sharp lower bound for the first extended zeroth-order connectivity index of trees with given numbers of vertices and pendant vertices,...
the emph{harary index} $h(g)$ of a connected graph $g$ is defined as $h(g)=sum_{u,vin v(g)}frac{1}{d_g(u,v)}$ where $d_g(u,v)$ is the distance between vertices $u$ and $v$ of $g$. the steiner distance in a graph, introduced by chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. for a connected graph $g$ of order at least $2$ and $ssubseteq v(g)$, th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید