نتایج جستجو برای: connected g
تعداد نتایج: 551215 فیلتر نتایج به سال:
In this paper we present an algorithm for determining whether a subgroup H of a non-connected reductive group G is G-completely reducible. The algorithm consists of a series of reductions; at each step, we perform operations involving connected groups, such as checking whether a certain subgroup of G is G-cr. This essentially reduces the problem of determining G-complete reducibility to the con...
Given a digraph (an undirected graph, resp.) D and two positive integers f (x); g(x) for every x 2 V (D), a subgraph H of D is called a (g; f)-factor if g(x) d + H (x) = d ? H (x) f (x)(g(x) d H (x) f (x), resp.) for every x 2 V (D). If f (x) = g(x) = 1 for every x, then a connected (g; f)-factor is a hamiltonian cycle. The previous research related to the topic has been carried out either for ...
the wiener index $w(g)$ of a connected graph $g$ is defined as $w(g)=sum_{u,vin v(g)}d_g(u,v)$ where $d_g(u,v)$ is the distance between the vertices $u$ and $v$ of $g$. for $ssubseteq v(g)$, the {it steiner distance/} $d(s)$ of the vertices of $s$ is the minimum size of a connected subgraph of $g$ whose vertex set is $s$. the {it $k$-th steiner wiener index/} $sw_k(g)$ of $g$ ...
the wiener index w(g) of a connected graph g is defined as the sum of the distances betweenall unordered pairs of vertices of g. the eccentricity of a vertex v in g is the distance to avertex farthest from v. in this paper we obtain the wiener index of a graph in terms ofeccentricities. further we extend these results to the self-centered graphs.
let $g$ be a connected graph, and let $d[g]$ denote the double graph of $g$. in this paper, we first derive closed-form formulas for different distance based topological indices for $d[g]$ in terms of that of $g$. finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
let $g$ be a connected graph with vertex set $v(g)$. the degree resistance distance of $g$ is defined as $d_r(g) = sum_{{u,v} subseteq v(g)} [d(u)+d(v)] r(u,v)$, where $d(u)$ is the degree of vertex $u$, and $r(u,v)$ denotes the resistance distance between $u$ and $v$. in this paper, we characterize $n$-vertex unicyclic graphs having minimum and second minimum degree resista...
For a graph G, the irregularity and total irregularity of G are defined as irr(G)=∑_(uv∈E(G))〖|d_G (u)-d_G (v)|〗 and irr_t (G)=1/2 ∑_(u,v∈V(G))〖|d_G (u)-d_G (v)|〗, respectively, where d_G (u) is the degree of vertex u. In this paper, we characterize all connected Eulerian graphs with the second minimum irregularity, the second and third minimum total irregularity value, respectively.
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou 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)$, the Steiner distance $d(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $...
The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید