نتایج جستجو برای: n th non commuting graph
تعداد نتایج: 2352292 فیلتر نتایج به سال:
The commuting graph $$\varDelta (G)$$ of a finite non-abelian group G is simple with vertex set G, and two distinct vertices x, y are adjacent if $$xy = yx$$ . In this paper, first we discuss some properties We determine the edge connectivity minimum degree prove that both equal. Then, other invariants, namely: matching number, clique boundary vertex, studied. Also, give necessary sufficient ...
we prove the generalized hyers--ulam stability of n--th order linear differential equation of the form $y^{(n)}+p_{1}(x)y^{(n-1)}+ cdots+p_{n-1}(x)y^{prime}+p_{n}(x)y=f(x)$, with condition that there exists a non--zero solution of corresponding homogeneous equation. our main results extend and improve the corresponding results obtained by many authors.
Let G be a group and X a subset of G. The commuting graph on X, denoted C(G,X), has vertex set X and an edge joining x, y ∈ X whenever xy = yx. If in addition X is a set of involutions, then C(G,X) is called a commuting involution graph. Commuting graphs have been investigated by many authors. Sometimes they are tools used in the proof of a theorem, or they may be studied as a way of shedding l...
Graph compositions are related to compositions of positive integers and partitions of finite sets, and have applications in electrical networks. This paper provides extensions of a previously known result which states that C(K N ) = B(N) B(N 2), where B(N) represents the N th Bell number and C(K N ) is the complete graph on N vertices with one edge deleted.
The symmetric m-th power of a graph is the graph whose vertices are m-subsets of vertices and in which two m-subsets are adjacent if and only if their symmetric difference is an edge of the original graph. It was conjectured that there exists a fixed m such that any two graphs are isomorphic if and only if their m-th symmetric powers are cospectral. In this paper we show that given a positive i...
We show that if μj is the j-th largest Laplacian eigenvalue, and dj is the j-th largest degree (1 ≤ j ≤ n) of a connected graph Γ on n vertices, then μj ≥ dj − j + 2 (1 ≤ j ≤ n− 1). This settles a conjecture due to Guo.
Let $R$ be a commutative ring and let $M$ be an $R$-module. We define the small intersection graph $G(M)$ of $M$ with all non-small proper submodules of $M$ as vertices and two distinct vertices $N, K$ are adjacent if and only if $Ncap K$ is a non-small submodule of $M$. In this article, we investigate the interplay between the graph-theoretic properties of $G(M)$ and algebraic properties of $M...
A contractive n-tuple A = (A1, . . . , An) has a minimal joint isometric dilation S = (S1, . . . , Sn) where the Si’s are isometries with pairwise orthogonal ranges. This determines a representation of the Cuntz-Toeplitz algebra. When A acts on a finite dimensional space, the wot-closed nonself-adjoint algebra S generated by S is completely described in terms of the properties of A. This provid...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید