در هنگام جستجو کلمه در قسمت عنوان میتوانید کلمات مورد جستجو را با کاراکتر (-) جدا کنید.
کاربرد نوع شرط:
- جایگاه : پژوهشی
- مجله: Journal of Algebraic Systems
- نوع مقاله: Journal Article
- کلمات کلیدی: conjugacy class,$p-$group,normal subset
- چکیده:
- چکیده انگلیسی: Suppose $G$ is a finite group, $A$ and $B$ are conjugacy classes of $G$ and $eta(AB)$ denotes the number of conjugacy classes contained in $AB$. The set of all $eta(AB)$ such that $A, B$ run over conjugacy classes of $G$ is denoted by $eta(G)$.
The aim of this paper is to compute $eta(G)$, $G in { D_{2n}, T_{4n}, U_{6n}, V_{8n}, SD_{8n}}$ or $G$ is a decomposable group of order $2pq$, a group of order $4p$ or $p^3$, where $p$ and $q$ are primes.- انتشار مقاله: 09-09-1393
- نویسندگان: M. Jalali,A. R. Ashrafi
- مشاهده
- جایگاه : پژوهشی
- مجله: Iranian Journal of Mathematical Chemistry
- نوع مقاله: Journal Article
- کلمات کلیدی: graph,Benzenoid chain,Tutte polynomial
- چکیده:
- چکیده انگلیسی: The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
- انتشار مقاله: 09-02-1393
- نویسندگان: G. FATH-TABAR,Z. GHOLAM-REZAEI,A. R. ASHRAFI
- مشاهده
- جایگاه : پژوهشی
- مجله: Iranian Journal of Mathematical Chemistry
- نوع مقاله: Journal Article
- کلمات کلیدی: Neighbourly irregular,Derived graphs,Product graphs
- چکیده:
- چکیده انگلیسی: A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
- انتشار مقاله: 19-12-1394
- نویسندگان: B. Basavanagoud,S. Patil,V. R. Desai,M. Tavakoli,A. R. Ashrafi
- مشاهده
- جایگاه : پژوهشی
- مجله: International Journal of Nanoscience and Nanotechnology
- نوع مقاله: Journal Article
- کلمات کلیدی: Dyck Graphs,Omega Polynomial,PIv Polynomial,Net Operation
- چکیده:
- چکیده انگلیسی: Design of crystal-like lattices can be achieved by using some net operations. Hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. The networks herein presented are related to the Dyck graph and described in terms of Omega polynomial and PIv polynomials.
- انتشار مقاله: 10-12-1388
- نویسندگان: Mircea V. Diudea,Katalin Nagy,Monica L. Pop,F. Gholami-Nezhaad,A. R. Ashrafi
- مشاهده
- جایگاه : پژوهشی
- مجله: International Journal of Nanoscience and Nanotechnology
- نوع مقاله: Journal Article
- کلمات کلیدی: Molecular Graph,Nanocone,edge Szeged index
- چکیده:
- چکیده انگلیسی: The edge Szeged index is a new molecular structure descriptor equal to the sum of products mu(e)mv(e) over all edges e = uv of the molecular graph G, where mu(e) is the number of edges which its distance to vertex u is smaller than the distance to vertex v, and nv(e) is defined analogously. In this paper, the edge Szeged index of one-pentagonal carbon nanocone CNC5[n] is computed for the first time.
- انتشار مقاله: 20-12-1386
- نویسندگان: A. R. Ashrafi,F. Gholami-Nezhaad
- مشاهده
- جایگاه : پژوهشی
- مجله: Algebraic Structures and Their Applications
- نوع مقاله: Journal Article
- کلمات کلیدی: Commuting conjugacy class graph,nilpotent group,$p-$group
- چکیده:
- چکیده انگلیسی: Suppose that $G$ is a finite non-abelian group. Define the graph $Gamma(G)$ with the non-central conjugacy classes of $G$ as vertex set and two distinct vertices $A$ and $B$ are adjacent if and only if there are $x in A$ and $y in B$ such that $xy = yx$. The graph $Gamma(G)$ is called the commuting conjugacy class graph of $G$ and introduced by Mohammadian et al. in [A. Mohammadian, A. Erfanian, M. Farrokhi D. G. and B. Wilkens, Triangle-free commuting conjugacy class graphs, {J. Group Theory} {19} (3) (2016) 1049--1061]. In this paper, the graph structure of the commuting conjugacy class graph of nilpotent groups of order $n$ are obtained in which $n$ is not divisible by $p^5$, for every prime factor $p$ of $n$.
- انتشار مقاله: 11-10-1397
- نویسندگان: M. A. Salahshour,A. R. Ashrafi
- مشاهده