نتایج جستجو برای: connected g
تعداد نتایج: 551215 فیلتر نتایج به سال:
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
Let $p:Xlo B$ be a locally trivial principal G-bundle and $wt{p}:wt{X}lo B$ be a locally trivial principal $wt{G}$-bundle. In this paper, by using the structure of principal bundles according to transition functions, we show that $wt{G}$ is a covering group of $G$ if and only if $wt{X}$ is a covering space of $X$. Then we conclude that a topological space $X$ with non-simply connected universal...
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
hansen et. al., using the autographix software package, conjectured that the szeged index $sz(g)$ and the wiener index $w(g)$ of a connected bipartite graph $g$ with $n geq 4$ vertices and $m geq n$ edges, obeys the relation $sz(g)-w(g) geq 4n-8$. moreover, this bound would be the best possible. this paper offers a proof to this conjecture.
let $n$ be any positive integer and let $f_n$ be the friendship (or dutch windmill) graph with $2n+1$ vertices and $3n$ edges. here we study graphs with the same adjacency spectrum as the $f_n$. two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. let $g$ be a graph cospectral with $f_n$. here we prove that if $g$ has no cycle of length $4$ or $...
The diameter of a connected graph $G$, denoted by $diam(G)$, is the maximum distance between any pair of vertices of $G$. Let $L(G)$ be the line graph of $G$. We establish necessary and sufficient conditions under which for a given integer $k geq 2$, $diam(L(G)) leq k$.
An MI-group is an algebraic structure based on a generalization of the concept of a monoid that satisfies the cancellation laws and is endowed with an invertible anti-automorphism representing inversion. In this paper, a topology is defined on an MI-group $G$ under which $G$ is a topological MI-group. Then we will identify open, discrete and compact MI-subgroups. The connected components of th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید