به جمع مشترکان مگیران بپیوندید!

تنها با پرداخت 70 هزارتومان حق اشتراک سالانه به متن مقالات دسترسی داشته باشید و 100 مقاله را بدون هزینه دیگری دریافت کنید.

برای پرداخت حق اشتراک اگر عضو هستید وارد شوید در غیر این صورت حساب کاربری جدید ایجاد کنید

عضویت

مقالات رزومه دکتر مجتبی قربانی

  • Afsane Khalilipour *, Modjtaba Ghorbani
    Perfect state transfer (\textit{PST}) on graphs due to their significant applications in quantum information processing and quantum computations. In the present work, we establish a characterization of Cayley graphs over $U_{6n}$ group, having \textit{PST}.
    Keywords: Linear Transformation, Perfect State Transfer, Matrix Representation, Cayley Graph}
  • مجتبی قربانی*، فاطمه سادات ایزدی، ستاره سادات روشن، رضا ابراهیم پور
    پیشینه و اهداف

    تبدیلات هندسی در طول تاریخ نقش مهمی در جنبه های مختلف زندگی بشر داشته اند. تقارن یکی از مفاهیم مهم در ریاضیات مدرسه است. واضح است که عملکرد تحصیلی دانش آموزان به طور پیچیده ای با دانش و مهارت های مربیان آن ها مرتبط است. با توجه به اهمیت نقش دانشجو معلمان به عنوان مربیان آینده، در مرحله اول، هدف این تحقیق بررسی و ارزیابی سطوح تفکر تبدیلات هندسی در بین دانشجو معلمان ابتدایی بر اساس نظریه یادگیری ون هیلی است. پس از آن، این تحقیق به دنبال بررسی فرآیند تفکر و ارزیابی الگوهای نگاه دانشجو معلمان آموزش ریاضی به عنوان گروه متخصص، با استفاده از روش علوم شناختی ردیاب چشم است.

    روش ها

    این مطالعه به بررسی و ارزیابی تفکر تبدیلات هندسی و مهارت های حل مسیله در میان دانشجو معلمان متمرکز است. روش تحقیق مورد استفاده پیمایشی آمیخته است. نمونه آماری در دسترس شامل 50 دانشجو معلم ابتدایی و 21 دانشجو معلم آموزش ریاضی ایرانی است. دانشجو معلمان ابتدایی از دانشگاه فرهنگیان اصفهان انتخاب شده و به دو گروه شامل 42 نفر از دانشجویانی که مفهوم تبدیلات هندسی را در مقطع کارشناسی نیاموخته بودند و 8 نفر از دانشجویانی که این مفهوم را در مقطع کارشناسی آموخته بودند، تقسیم شدند. برای بررسی سطح تفکر هندسی شرکت کنندگان، از آزمونی محقق ساخته بر اساس نظریه ون هیلی استفاده شد. پایایی آزمون با استفاده از ضریب آلفای کرونباخ ارزیابی شد که مقدار 0.68 بدست آمد. روایی آزمون نیز توسط اساتید مورد تایید قرار گرفت. در ارزیابی تفکر هندسی، یکی از روش های علوم شناختی به کار گرفته شد. این روش شامل طراحی آزمون روان-فیزیک همراه ثبت حرکات چشم در گروه دانشجو معلمان آموزش ریاضی بود. آزمون روان-فیزیک در آزمایشگاه کامپیوتر دانشگاه تربیت معلم شهید رجایی تهران با دستگاه Eyelink و نرم افزار MATLAB بر روی دانشجو معلمان آموزش ریاضی این دانشگاه، انجام شد.

    یافته ها

    یافته های تحقیق نشان داد که دانشجویان، شکل با تقارن را به عنوان شکل متقارن تشخیص می دهند، اما در تعیین نوع تقارن اشکال متقارن عملکرد ضعیفی دارند، به ویژه زمانی که یک شکل دارای تقارن چرخشی یا تقارن محوری مایل یا ترکیبی از چندین نوع تقارن باشد. 34% از دانشجو معلمان آموزش ابتدایی در سطح اول و 18% در سطح دوم نظریه ون هیلی قرار گرفتند. یافته های شناختی نشان داد که دانشجو معلمان آموزش ریاضی در تشخیص اشکال متقارنی که با یک نوع تقارن مشخص شده اند نسبت به شکل هایی که شامل ترکیبی از تقارن های مختلف هستند، عملکرد نسبتا موفق تری داشته اند. بررسی تصاویر ثبت شده ردیابی چشم دانشجویان، تمایزی را در الگوهای نگاه، بین گروه هایی که پاسخ های درست و نادرست در ارایه می دادند، نشان داد. علاوه بر این، این تفاوت در بین تصاویر با تقارن های مختلف(خطی، مرکزی، چرخشی) نیز مشهود است.

    نتیجه گیری

    پژوهش حاضر ضعف دانشجو معلمان در شناسایی نوع تقارن در اشکال را تایید می کند. همچنین بر نیاز به توجه بیشتر به امور برای رسیدگی به این موضوع، پیشنهاد می شود که برنامه درسی مربوط به تبدیلات هندسی در دوره آموزشی دانشگاه دانشجو معلمان مورد بازنگری قرار گیرد. علاوه بر این، استفاده از نرم افزارهایی مانند واقعیت افزوده و جیوجبرا می تواند به افزایش توانایی های شناختی و بصری دانشجو معلمان در درک و تشخیص مفهوم تقارن کمک کند.

    کلید واژگان: تبدیلات هندسی, تقارن چرخشی, تقارن مرکزی, دانشجو معلم, علوم شناختی}
    .M. Ghorbani *, F.S. Izadi, S.S. Roshan, R. Ebrahimpour
    Background and Objectives

    Geometric transformations have played a crucial role throughout history in various aspects of human life. Symmetry is one of the important concepts in school mathematics. Students' academic performance is intricately connected to the knowledge and skills of their educators. Recognizing the importance of prospective teachers )PTs( as future educators, in the initial stage, the aim of this research is to assess and analyze the levels of geometric thinking among prospective elementary teachers )PETs( utilizing Van Hiele's theory. Subsequently, the research seeks to delve into the thinking process and gaze patterns of prospective mathematics education teachers (PMETs) using the cognitive science method of eye tracking.

    Materials and Methods

    This study focuses on investigating and evaluating the thinking of geometric transformations and problem-solving skills among prospective teachers (PTs(. The research method employed a combined survey method, encompassing two distinct tests conducted on two groups of PTs. The accessible statistical sample includes 50 participating PETs and 21 participating PEMTs from Iran. The PETs of Farhangian University of Isfahan were divided into two groups: 42 students who had not learned the concept of geometric transformations in their undergraduate program (NPGT), and 8 students who had learned this concept in their undergraduate program )PGT). To assess the level of geometric thinking among participants, a self-made geometric test based on Van Hiele’s theory was utilized. The test reliability was assessed using Cronbach's alpha coefficient, which yielded a value of 0.68. Additionally, the validity of the test has been confirmed by some professors. In evaluating geometric thinking, a cognitive science method was performed. This method involved designing a psychophysical experiment and recording eye movements of the PMETs. The psychophysical experiment part was conducted in the computer laboratory of Shahid Rajaee Teacher Training University, Tehran, and was performed by Eyelink device and MATLAB software on student teachers of mathematics education of this university.

    Findings

    The results of the research show that students recognize the shape with symmetry as a symmetrical shape, but they perform poorly in determining the type of symmetry of symmetrical shapes, especially when a shape has rotational symmetry or oblique axial symmetry or a combination of several types of symmetry. In the first stage, the evaluation of PETs responses showed that 34% of them were in the first level and 18% in the second level of Van Hiele. The cognitive findings revealed that PMETs demonstrated superior performance in recognizing symmetries characterized by a single type of symmetry, in contrast to shapes involving combinations of various symmetries. Examining the recorded eye-tracking images of the students revealed a difference in gaze patterns between the groups that gave correct and incorrect answers. In addition, this difference is also evident among images with different symmetries (reflection, central, rotational).

    Conclusions

    The current research confirms the weakness of students in identifying the type of symmetry in symmetrical shapes. It also emphasizes the need to pay more attention to the training of PTs during their academic years. To address this, it is suggested to revise the curriculum concerning geometric transformations in the university courses for PTs training, additionally, the utilization of software such as Augmented Reality (AR) and GeoGebra can .contribute to enhancing cognitive and visual abilities of PTs in comprehending the concept of symmetry

    Keywords: Transformations, Rotational symmetry, Central symmetry, Prospective teacher, Cognitive science}
  • Afsaneh Khalilipour, Modjtaba Ghorbani *
    Perfect state transfer (\textit{PST}) on graphs due to their significant applications in quantum information processing and quantum computations. In the present work, we establish a characterization of Cayley graphs over $U_{6n}$ group, having \textit{PST}.
    Keywords: Linear transformation, perfect state transfer, matrix representation, Cayley graph}
  • Tomislav Doslic, Modjtaba Ghorbani *, Ottorino Ori
    Ali Reza Ashrafi (10 May 1964 9 January 2023) was an Iranian mathematician who worked in computational group theory and mathematical chemistry. Ashrafi was a professor at the Department of Pure Mathematics of the University of Kashan.
    Keywords: university of Kashan, Ali Reza Ashrafi, Mathematics}
  • Modjtaba Ghorbani

    A topological index is a numerical invariant associated with a chemical graph. In thispaper we introduce some GAP programs for computing well-known topological indices.

    Keywords: Wiener Index, Szeged Index, PI Index, Vertex-PI Index}
  • Modjtaba Ghorbani *, Mardjan Hakimi Nezhaad

    Let G be a simple graph with n vertices and with the Seidel matrix S‎. ‎Suppose μ1‎, ‎μ2,..., μn are the Seidel eigenvalues of G‎. ‎The Estrada index of the Seidel matrix of G is defined as SEE(G)=‎sum_{i=1}^{n} eμi‎. ‎In this paper‎, ‎we compute the Estrada index of the Seidel matrix of some known graphs‎. ‎Also‎, ‎some bounds for the Seidel energy of graphs are given‎.

    Keywords: Seidel matrix, Seidel eigenvalue, Estrada index}
  • Modjtaba Ghorbani *, Shaghayegh Rahmani, Mohammad Eslampoor

    A general bond additive index (GBA) can be defined as , where α(e) is edge contributions. The Mostar index is a new topological index whose edge contributions are α(e) = | nu - nv| in which nu is the number of vertices of lying closer to vertex u than to vertex v and nv can be defined similarly. In this paper, we propose some new results on the Mostar index based on the vertex-orbits under the action of automorphism group. In addition, we detrmined the structures of graphs with Mostar index equal 1. Finally, compute the Mostar index of a family of nanocone graphs.

    * The formula is not displayed correctly.

    Keywords: Molecular graphs, topological index, Automorphism group}
  • Modjtaba Ghorbani *, Shaghayegh Rahmani, Ottorino Ori
    For the edge e = uv of a graph G, let nu = n(u|G) be the number of vertices of G lying closer to the vertex u than to the vertex v and nv= n(v|G) can be defined simailarly. Then the ABCGG index of G is defined as ABCGG =sum_{e=uv} sqrt{f(u,v)}, where f(u,v)= (nu+nv-2)/nunvThe aim of this paper is to give some new results on this graph invariant. We also calculate the ABCGG of an infinite family of fullerenes.
    Keywords: Atom bond connectivity index, Molecular graphs, topological index}
  • Abdollah Lotfi, Modjtaba Ghorbani *, Hamid Mesgarani

    The PageRank (PR) algorithm is the base of Google search engine. In this paper, we study the PageRank sequence for undirected graphs of order six by PR vector. Then, we provide an ordering for graphs by variance of PR vector which it’s variation is proportional with variance of degree sequence. Finally, we introduce a relation between domination number and PR-variance of graphs.

    Keywords: PageRank algorithm, google matrix, Domination number, isomorphism}
  • M. Ghorbani *, A. Seyyed Hadi, F. Nowroozi

    A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.

    Keywords: symmetric graph, Cayley graph, normal graph, arc-transitive graph}
  • Modjtaba Ghorbani *, Mina Rajabi, Parsa
    A permutation with no fixed points is called a derangement. The subset D of a permutation group is derangement if all elements of D are derangement. Let G be a permutation group, a derangement graph is one with vertex set G and derangement set D as connecting set. In this paper, we determine the spectrum of derangement graphs of order a product of three primes.
    Keywords: permutation groups, graph eigenvalues, Frobenius group}
  • Aziz Seyyed Hadi, Modjtaba Ghorbani*, Farzaneh Nowroozi Larki

    ‎Suppose G is a group of order p^2q^2 where p>q are prime numbers and suppose P and Q are Sylow p-subgroups and Sylow q-subgroups of G, ‎respectively‎. ‎In this paper‎, ‎we show that up to isomorphism‎, ‎there are four groups of order p^2q^2 when Q and P are cyclic‎, ‎three groups when Q is a cyclic and P is an elementary ablian group‎, ‎p^2+3p/2+7 groups when Q is an elementary ablian group and P is a cyclic group and finally‎, ‎p‎ + ‎5 groups when both Q and P are elementary abelian groups.‎

    Keywords: Semi-direct product, p-group, Sylow subgroup}
  • S. Zangi, M. Ghorbani *, M. Eslampour
    The aim of this paper is to compute some bounds of forgotten index and then we present spectral properties of this index. In continuing, we define a new version of energy namely ISI energy corresponded to the ISI index and then we determine some bounds for it.
    Keywords: Zagreb indices, forgotten index, ISI index, energy of graph}
  • Modjtaba Ghorbani *, Zahra Gharavi, Ali Zaeem-Bashi
    The non-commuting graph Γ(G) of a non-abelian group G with the center Z(G) is a graph with the vertex set V(Γ(G))=G∖Z(G) and two distinct vertices x and y are adjacent in Γ(G) if and only if xy≠yx . The aim of this paper is to compute the spectra of some well-known NC-graphs.
    Keywords: non-commuting graph, characteristic polynomial, center of group}
  • M. Ghorbani *, F. Abbasi
    Let G be a nite group and C(G) be the family of representative conjugacy classes of subgroups of G. The matrix whose H;K-entry is the number of xed points of the set G=K under the action of H is called the table of marks of G where H;K run through all elements in C(G). In this paper, we compute the table of marks and the markaracter table of groups of order pqr where p, q, r are prime numbers.
    Keywords: Frobenius group, table of marks, conjugacy class of subgroup}
  • A. Khaksari, M. Ghorbani *
    The forgotten topological index is defined as sum of third power of degrees. In this paper, we compute some properties of forgotten index and then we determine it for some classes of product graphs.
    Keywords: Zagreb indices, Forgotten index, Graph products}
  • M. Ghorbani *, Z. Gharavi Alkhansari

    For given non-abelian group G, the non-commuting (NC)-graph $Gamma(G)$ is a graph with the vertex set $G$ $Z(G)$ and two distinct vertices $x, yin V(Gamma)$ are adjacent whenever $xy neq yx$. The aim of this paper is to compute the spectra of some well-known NC-graphs.

    Keywords: Non-commuting graph, Characteristic polynomial, linear group}
  • M. Hakimi Nezhaad, M. Ghorbani *

    ‎Let $G$ be a graph without an isolated vertex‎, ‎the normalized Laplacian matrix $tilde{mathcal{L}}(G)$‎ ‎is defined as $tilde{mathcal{L}}(G)=mathcal{D}^{-frac{1}{2}}mathcal{L}(G)mathcal{D}^{-frac{1}{2}}$‎, where ‎$mathcal{D}$ ‎is a‎ diagonal matrix whose entries are degree of ‎vertices ‎‎of ‎$‎G‎$‎‎. ‎The eigenvalues of‎ $tilde{mathcal{L}}(G)$ are ‎called as ‎the ‎normalized Laplacian eigenvalues of $G$‎. ‎In this paper‎, ‎we obtain the normalized Laplacian spectrum of two new types of join graphs‎. ‎In continuing‎, ‎we determine the integrality of normalized Laplacian eigenvalues of graphs‎. ‎Finally‎, ‎the normalized Laplacian energy and degree Kirchhoff index of these new graph ‎products‎ are derived‎.

    Keywords: Join of graphs‎, ‎normalized Laplacian eigenvalue, integral eigenvalue‎}
  • H. Shabani, A. R. Ashrafi, M. Ghorbani
    The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational character tables are also considered into account.
    The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational character tables are also considered into account.
    Keywords: Rational character table, character table, Galois group}
  • M. Ghorbani*
    Let G be a finite group and C(G) be the family of representative conjugacy classes ofý ýsubgroups of Gý. ýThe matrix whose H,K-entry is the number of ýfixed points of the set G/K under the action of H is called theý ýtable of marks of G where H,K run through all elements iný C(G)ý. Shinsaku Fujita for the first time introduced the term “markaracter” to discuss marks for permutation representations and characters for linear representations in a common basis. In this paper, we compute these tables for some classes of finite groups.
    Keywords: group action, automorphism group, mark table, markaracter table}
  • M. Ghorbani *, F. Nowroozi Larki
    H\"{o}lder in 1893 characterized all groups of order pqr where p>q>r are prime numbers. In this paper, by using new presentations of these groups, we compute their full automorphism group.
    Keywords: Affine group, Frobenius group, Automorphism group}
  • M. Ghorbani
    A graph $Gamma$ is said to be vertex-transitive or edge - transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma $, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-transitive Cayley graphs of the groups $D_ 2n}$ and $T_{4n}$ are given.
    Keywords: ýEýigenvaluesý, ýCayley graphsý, ýnormal graph}
  • N. Azimi, M. Roumena, M. Ghorbani
    In theoretical chemistry, molecular structure descriptors are used to compute properties of chemical compounds. Among them Wiener, Szeged and detour indices play significant roles in anticipating chemical phenomena. In the present paper, we study these topological indices with respect to their difference number.
    Keywords: Wiener index, Szeged index, detour index}
  • M. Ghorbani, M. Songhori
    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 sets differ in size by at most 1. The Wiener number [1] is the first reported distance based topological index and is defined as half sum of the distances between all the pairs of vertices in a molecular graph. Recently, some new versions of Zagreb indices are considered by mathematicians. In the present study we compute some bounds of multiplicative Zagreb indices and then we study these topological indices by using concept of chromatic number and clique number.
    Keywords: multiplicative Zagreb index, clique number, independence number, chromatic number}
نمایش عناوین بیشتر...
فهرست مطالب این نویسنده: 38 عنوان
  • دکتر مجتبی قربانی
    قربانی، مجتبی
    استاد ریاضی، ریاضی، علوم پایه، دانشگاه تربیت دبیر شهید رجایی
  • نویسندگان همکار
  • دکتر سعید علیخانی
    : 1
    علیخانی، سعید
    استاد ریاضی، دانشکده علوم ریاضی دانشگاه یزد، دانشگاه یزد
بدانید!
  • این فهرست شامل مطالبی از ایشان است که در سایت مگیران نمایه شده و توسط نویسنده تایید شده‌است.
  • مگیران تنها مقالات مجلات ایرانی عضو خود را نمایه می‌کند. بدیهی است مقالات منتشر شده نگارنده/پژوهشگر در مجلات خارجی، همایش‌ها و مجلاتی که با مگیران همکاری ندارند در این فهرست نیامده‌است.
  • اسامی نویسندگان همکار در صورت عضویت در مگیران و تایید مقالات نمایش داده می شود.
درخواست پشتیبانی - گزارش اشکال