Pub Date : 2025-10-10DOI: 10.1007/s13370-025-01381-y
Liam B. Baker, Jonathan Kariv, Ronald J. Maartens
Let G be a nontrivial connected graph with an edge coloring, and let (u,v in V(G)). A (u-v) path in G is said to be a rainbow path if no color is repeated on the edges of the path. Similarly, we define a rainbow geodesic. A rainbow connected graphG is a graph with an edge coloring such that every two vertices in G are connected by a rainbow path. Further, a strong rainbow connected graphG is a graph with an edge coloring such that every two vertices in G is connected by a rainbow geodesic. The minimum number of colors needed to make a graph rainbow connected is called the rainbow connection number, denoted ({{,textrm{rc},}}(G)), and the minimum number of colors needed to make a graph strong rainbow connected is called the strong rainbow connection number, denoted ({{,textrm{src},}}(G)). In this paper we determine ({{,textrm{rc},}}(G)) and ({{,textrm{src},}}(G)) when G is a n-dimensional rectangular grid graph, triangular grid graph, hexagonal grid graph, and a (weak) Bruhat graph, respectively. We show for all these families that ({{,textrm{src},}}(G)={{,textrm{diam},}}(G)).
设G是一个边着色的非平凡连通图,设(u,v in V(G))。如果路径边缘没有重复的颜色,则G中的(u-v)路径被称为彩虹路径。同样,我们定义彩虹测地线。彩虹连通图G是一种具有边缘着色的图,使得G中的每两个顶点都通过彩虹路径连接。此外,强彩虹连通图G是具有边缘着色的图,使得G中的每两个顶点由彩虹测地线连接。使图形具有彩虹连接所需的最小颜色数称为彩虹连接数,记为({{,textrm{rc},}}(G)),而使图形具有强彩虹连接数所需的最小颜色数称为强彩虹连接数,记为({{,textrm{src},}}(G))。本文分别确定了当G为n维矩形网格图、三角形网格图、六边形网格图和(弱)Bruhat图时的({{,textrm{rc},}}(G))和({{,textrm{src},}}(G))。我们向所有这些家庭展示({{,textrm{src},}}(G)={{,textrm{diam},}}(G))。
{"title":"The rainbow connected number of several infinite graph families","authors":"Liam B. Baker, Jonathan Kariv, Ronald J. Maartens","doi":"10.1007/s13370-025-01381-y","DOIUrl":"10.1007/s13370-025-01381-y","url":null,"abstract":"<div><p>Let <i>G</i> be a nontrivial connected graph with an edge coloring, and let <span>(u,v in V(G))</span>. A <span>(u-v)</span> path in <i>G</i> is said to be a <i>rainbow path</i> if no color is repeated on the edges of the path. Similarly, we define a <i>rainbow geodesic</i>. A <i>rainbow connected graph</i> <i>G</i> is a graph with an edge coloring such that every two vertices in <i>G</i> are connected by a rainbow path. Further, a <i>strong rainbow connected graph</i> <i>G</i> is a graph with an edge coloring such that every two vertices in <i>G</i> is connected by a rainbow geodesic. The minimum number of colors needed to make a graph rainbow connected is called the <i>rainbow connection number</i>, denoted <span>({{,textrm{rc},}}(G))</span>, and the minimum number of colors needed to make a graph strong rainbow connected is called the <i>strong rainbow connection number</i>, denoted <span>({{,textrm{src},}}(G))</span>. In this paper we determine <span>({{,textrm{rc},}}(G))</span> and <span>({{,textrm{src},}}(G))</span> when <i>G</i> is a <i>n</i>-dimensional rectangular grid graph, triangular grid graph, hexagonal grid graph, and a (weak) Bruhat graph, respectively. We show for all these families that <span>({{,textrm{src},}}(G)={{,textrm{diam},}}(G))</span>.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 4","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s13370-025-01381-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145256188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-10DOI: 10.1007/s13370-025-01382-x
Eric O. D. Andriantiana, Xhanti Sinoxolo
The energy En(G) of a graph G is defined as the sum of the absolute values of its eigenvalues. The Hosoya index Z(G) of a graph G is the number of independent edge subsets of G, including the empty set. For any given degree sequence D, we characterize the caterpillar (mathcal {S}(D)) that has the minimum Z and En. We also show that (Z(mathcal {S}(D))<Z(mathcal {S}(Y))) and (En(mathcal {S}(D))<En(mathcal {S}(Y))) for any degree sequences (Y=(y_1,dots ,y_n)) and (D=(d_1,dots ,d_n)) with
$$sum _{i=1}^{n}y_i=sum _{i=1}^{n}d_itext { and }sum _{i=1}^{k}y_ile sum _{i=1}^{k}d_i text { for all }1le k le n.$$
图G的能量En(G)定义为其特征值的绝对值之和。图G的细谷指数Z(G)是图G的独立边子集的个数,包括空集。对于任意给定的度序列D,我们描述具有最小Z和最小En的毛虫(mathcal {S}(D))。我们还证明了(Z(mathcal {S}(D))<Z(mathcal {S}(Y)))和(En(mathcal {S}(D))<En(mathcal {S}(Y)))对于任何阶序列(Y=(y_1,dots ,y_n))和(D=(d_1,dots ,d_n))$$sum _{i=1}^{n}y_i=sum _{i=1}^{n}d_itext { and }sum _{i=1}^{k}y_ile sum _{i=1}^{k}d_i text { for all }1le k le n.$$
{"title":"Small energy and Hosoya index among caterpillars with a given degree sequence","authors":"Eric O. D. Andriantiana, Xhanti Sinoxolo","doi":"10.1007/s13370-025-01382-x","DOIUrl":"10.1007/s13370-025-01382-x","url":null,"abstract":"<div><p>The energy <i>En</i>(<i>G</i>) of a graph <i>G</i> is defined as the sum of the absolute values of its eigenvalues. The Hosoya index <i>Z</i>(<i>G</i>) of a graph <i>G</i> is the number of independent edge subsets of <i>G</i>, including the empty set. For any given degree sequence <i>D</i>, we characterize the caterpillar <span>(mathcal {S}(D))</span> that has the minimum <i>Z</i> and <i>En</i>. We also show that <span>(Z(mathcal {S}(D))<Z(mathcal {S}(Y)))</span> and <span>(En(mathcal {S}(D))<En(mathcal {S}(Y)))</span> for any degree sequences <span>(Y=(y_1,dots ,y_n))</span> and <span>(D=(d_1,dots ,d_n))</span> with </p><div><div><span>$$sum _{i=1}^{n}y_i=sum _{i=1}^{n}d_itext { and }sum _{i=1}^{k}y_ile sum _{i=1}^{k}d_i text { for all }1le k le n.$$</span></div></div></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 4","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s13370-025-01382-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145256184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-10DOI: 10.1007/s13370-025-01378-7
T. Bharathi, Arul Priya Sampath
Plithogenic product intuitionistic fuzzy graph is a novel graphical model for representing complex systems characterised by multi-valued dyadic attributes. It provides four or more dyadic attributes to its elements, consisting of ({mu }) membership values and ({nu }) non-membership values. The dyadic attribute values of the edges are calculated using the (*) operator. In this paper, various properties and characterisations of Plithogenic product intuitionistic fuzzy graphs, including order, size, path, and cycle, are analysed to show the utility of the Plithogenic product intuitionistic fuzzy graphs. Additionally, weight, strength, the strength of connectedness, and subgraphs of Plithogenic product intuitionistic fuzzy graphs are newly introduced, accompanied by examples and figures, to examine the connectivity between parts and the significance of each part.
{"title":"Plithogenic product intuitionistic fuzzy graph","authors":"T. Bharathi, Arul Priya Sampath","doi":"10.1007/s13370-025-01378-7","DOIUrl":"10.1007/s13370-025-01378-7","url":null,"abstract":"<div><p>Plithogenic product intuitionistic fuzzy graph is a novel graphical model for representing complex systems characterised by multi-valued dyadic attributes. It provides four or more dyadic attributes to its elements, consisting of <span>({mu })</span> membership values and <span>({nu })</span> non-membership values. The dyadic attribute values of the edges are calculated using the (*) operator. In this paper, various properties and characterisations of Plithogenic product intuitionistic fuzzy graphs, including order, size, path, and cycle, are analysed to show the utility of the Plithogenic product intuitionistic fuzzy graphs. Additionally, weight, strength, the strength of connectedness, and subgraphs of Plithogenic product intuitionistic fuzzy graphs are newly introduced, accompanied by examples and figures, to examine the connectivity between parts and the significance of each part.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 4","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145256185","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-10DOI: 10.1007/s13370-025-01386-7
Amani M. Alfadhli
The decorated Partial Brauer algebras are finite dimensional diagram algebras contain Brauer algebras, Partial Brauer algebras and the group algebras (Rwidetilde{S_{n}}), where (widetilde{S_{n}}) is the wreath product group (mathbb {Z}_{2}wr S_{n}) of (mathbb {Z}_{2}) with (S_{n}). In this paper, we study the semisimplicity criterion of the decorated partial Brauer algebras using two functors F and G. In particular, we determine for which value of the parameters this algebra is semisimple. This result can be considered as a generalization of Hanlon–Wales conjecture on Brauer algebra.
{"title":"On the semisimplicity of the decorated partial Brauer algebras","authors":"Amani M. Alfadhli","doi":"10.1007/s13370-025-01386-7","DOIUrl":"10.1007/s13370-025-01386-7","url":null,"abstract":"<div><p>The decorated Partial Brauer algebras are finite dimensional diagram algebras contain Brauer algebras, Partial Brauer algebras and the group algebras <span>(Rwidetilde{S_{n}})</span>, where <span>(widetilde{S_{n}})</span> is the wreath product group <span>(mathbb {Z}_{2}wr S_{n})</span> of <span>(mathbb {Z}_{2})</span> with <span>(S_{n})</span>. In this paper, we study the semisimplicity criterion of the decorated partial Brauer algebras using two functors <i>F</i> and <i>G</i>. In particular, we determine for which value of the parameters this algebra is semisimple. This result can be considered as a generalization of Hanlon–Wales conjecture on Brauer algebra.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 4","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145256186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
have been considered to date. We show that there are self-similarities of the coefficients of (V_1(q)). As consequences, we find congruences like the one below. For all (nge 0) and (kge 1), we have
{"title":"Congruences Modulo 2 for the Eighth-Order Mock Theta Function (V_1(q))","authors":"Hirakjyoti Das","doi":"10.1007/s13370-025-01380-z","DOIUrl":"10.1007/s13370-025-01380-z","url":null,"abstract":"<div><p>Not many of the congruence properties of the eighth-order mock theta function <span>(V_1(q))</span>: </p><div><div><span>$$begin{aligned} V_1(q):=sum _{n=0}^infty dfrac{q^{(n+1)^2}left( -q;q^2right) _n}{left( q;q^2right) _{n+1}}=sum _{n=1}^infty v_1(n)q^n end{aligned}$$</span></div></div><p>have been considered to date. We show that there are self-similarities of the coefficients of <span>(V_1(q))</span>. As consequences, we find congruences like the one below. For all <span>(nge 0)</span> and <span>(kge 1)</span>, we have </p><div><div><span>$$begin{aligned} v_1left( 6times 29^{2 k} n+ 6times 29^{2 k-1} s+dfrac{7times 29^{2 k-1}+1}{4}right) equiv 0 pmod {2} end{aligned}$$</span></div></div><p>for <span>(0le s< 29)</span>, <span>(sne 13)</span>.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 4","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145211010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-30DOI: 10.1007/s13370-025-01379-6
Rıdvan Fatih Örs, Canan Köroğlu, Ayhan Aydın
In this paper, a numerical method based on the conservative finite difference scheme is constructed to numerically solve the strongly coupled nonlinear Schrödinger (SCNLS) equation. Conservative properties such as energy and mass of the SCNLS equation have been proven. In particular a fourth-order central difference scheme is used to discretize the the spatial derivative and a second-order Crank-Nicolson type discretization is used to discretize the temporal derivative. It has been shown that the proposed scheme preserves the discrete mass and energy. The existence of discrete solution is also investigated. Several numerical results are given to demonstrate the preservation properties of the new method. Also, the effect of the linear coupling parameters on the evolution of solitary waves is investigated.
{"title":"A new conservative numerical method for strongly coupled nonlinear Schrödinger equations","authors":"Rıdvan Fatih Örs, Canan Köroğlu, Ayhan Aydın","doi":"10.1007/s13370-025-01379-6","DOIUrl":"10.1007/s13370-025-01379-6","url":null,"abstract":"<div><p>In this paper, a numerical method based on the conservative finite difference scheme is constructed to numerically solve the strongly coupled nonlinear Schrödinger (SCNLS) equation. Conservative properties such as energy and mass of the SCNLS equation have been proven. In particular a fourth-order central difference scheme is used to discretize the the spatial derivative and a second-order Crank-Nicolson type discretization is used to discretize the temporal derivative. It has been shown that the proposed scheme preserves the discrete mass and energy. The existence of discrete solution is also investigated. Several numerical results are given to demonstrate the preservation properties of the new method. Also, the effect of the linear coupling parameters on the evolution of solitary waves is investigated.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 4","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145211014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-30DOI: 10.1007/s13370-025-01383-w
Béchir Amri
In this work, we provide an elementary proof of an integral product formula for Jack polynomials of two variables, extending the well-known case of zonal polynomials. As an application, we derive an explicit integral representation for the Dunk- Bessel function of type (B_2).
{"title":"About integral product formula for Jack polynomials of two variables","authors":"Béchir Amri","doi":"10.1007/s13370-025-01383-w","DOIUrl":"10.1007/s13370-025-01383-w","url":null,"abstract":"<div><p>In this work, we provide an elementary proof of an integral product formula for Jack polynomials of two variables, extending the well-known case of zonal polynomials. As an application, we derive an explicit integral representation for the Dunk- Bessel function of type <span>(B_2)</span>.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 4","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145211015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-16DOI: 10.1007/s13370-025-01377-8
Ishtaq Ahmad
The Linear Canonical Transform (LCT) serves as a powerful generalization of the Fourier and fractional Fourier transforms, with significant implications in signal processing, optics, and quantummechanics. This paper develops a novel representation-theoretic framework for the LCT by leveraging the unitary dual of the Heisenberg group and the metaplectic representation of the symplectic group. Beyond recovering known uncertainty principles, we present refined inequalities that explicitly depend on the LCT parameter matrix and derive new structural results for the spectral decomposition of LCT operators. In particular, we provide a distributional spectral analysis for degenerate LCT cases ((b = 0)), introduce entropic uncertainty bounds tailored to the LCT domain, and propose a group-theoretic formulation of sparsity constraints. These findings significantly extend classical results and offer a deeper understanding of the LCT in both theoretical and applied contexts. We conclude with suggestions for quantum state manipulation via LCTs and numerical illustrations that bridge abstract theory with practical computation.
{"title":"Representation-theoretic framework for the linear canonical transform in quantum harmonic analysis","authors":"Ishtaq Ahmad","doi":"10.1007/s13370-025-01377-8","DOIUrl":"10.1007/s13370-025-01377-8","url":null,"abstract":"<div><p>The Linear Canonical Transform (LCT) serves as a powerful generalization of the Fourier and fractional Fourier transforms, with significant implications in signal processing, optics, and quantummechanics. This paper develops a novel representation-theoretic framework for the LCT by leveraging the unitary dual of the Heisenberg group and the metaplectic representation of the symplectic group. Beyond recovering known uncertainty principles, we present refined inequalities that explicitly depend on the LCT parameter matrix and derive new structural results for the spectral decomposition of LCT operators. In particular, we provide a distributional spectral analysis for degenerate LCT cases (<span>(b = 0)</span>), introduce entropic uncertainty bounds tailored to the LCT domain, and propose a group-theoretic formulation of sparsity constraints. These findings significantly extend classical results and offer a deeper understanding of the LCT in both theoretical and applied contexts. We conclude with suggestions for quantum state manipulation via LCTs and numerical illustrations that bridge abstract theory with practical computation.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 4","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145062212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-16DOI: 10.1007/s13370-025-01374-x
Hassen Khlif
We investigate the essential spectrum of linear pencils in Banach algebras, particularly their behavior under ideal perturbations. Building upon the foundational work of J. Shapiro and M. Snow in [The Fredholm spectrum of the sum and product of two operators, Transactions of the American Mathematical Society, 191 (1974), 387-393] on the Fredholm spectrum in Banach spaces, this study introduces novel characterizations of quasi-inverses and their role in spectral analysis. By leveraging these characterizations, we derive conditions ensuring that the essential spectrum of a linear pencil is confined within a specific sector of the complex plane. Our findings establish a refined connection between Fredholm theory and the algebraic structure of Banach algebras, offering both theoretical advancements and geometric insights into spectral containment. These results extend existing frameworks and open avenues for exploring spectral properties in more general algebraic settings with applications in operator theory and differential equations.
我们研究了Banach代数中线性铅笔的本质谱,特别是它们在理想扰动下的行为。在J. Shapiro和M. Snow关于Banach空间中的Fredholm谱的基础工作[两个算子的和和积的Fredholm谱,Transactions of the American Mathematical Society, 191(1974), 387-393]的基础上,本研究引入了准逆的新特征及其在谱分析中的作用。通过利用这些特征,我们得出了确保线性铅笔的基本光谱被限制在复平面的特定扇形内的条件。我们的研究结果在Fredholm理论和Banach代数结构之间建立了一个精细的联系,为光谱遏制提供了理论进步和几何见解。这些结果扩展了现有的框架,并为在算子理论和微分方程的应用中探索更一般的代数设置中的谱性质开辟了道路。
{"title":"Unveiling quasi inverses of linear pencils in Banach algebra","authors":"Hassen Khlif","doi":"10.1007/s13370-025-01374-x","DOIUrl":"10.1007/s13370-025-01374-x","url":null,"abstract":"<div><p>We investigate the essential spectrum of linear pencils in Banach algebras, particularly their behavior under ideal perturbations. Building upon the foundational work of J. Shapiro and M. Snow in [The Fredholm spectrum of the sum and product of two operators, Transactions of the American Mathematical Society, 191 (1974), 387-393] on the Fredholm spectrum in Banach spaces, this study introduces novel characterizations of quasi-inverses and their role in spectral analysis. By leveraging these characterizations, we derive conditions ensuring that the essential spectrum of a linear pencil is confined within a specific sector of the complex plane. Our findings establish a refined connection between Fredholm theory and the algebraic structure of Banach algebras, offering both theoretical advancements and geometric insights into spectral containment. These results extend existing frameworks and open avenues for exploring spectral properties in more general algebraic settings with applications in operator theory and differential equations.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 4","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145062211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-16DOI: 10.1007/s13370-025-01376-9
Sahawat Wongkhunen, Pongdate Montagantirud
In recent years, the notions of discrete homotopy for graphs, such as A-homotopy and (times)-homotopy fundamental groupoid for graphs, have been introduced. This paper develops the notion of a looped fundamental groupoid for graphs to the isotropy group of the vertex v in the fundamental groupoid. We show that it is similar to the classical fundamental group of a topological space and the A-theory of graphs in some sense. Then, we generalize the concept of this theory to the looped fundamental group of weighted reflexive graphs and investigate some properties for the classification of weighted reflexive graphs in various situations. Moreover, we show that it satisfies the Seifert–Van Kampen property, with analogous results similar to the classical theory. Finally, we discuss the conclusion, its applications in the real world, and future works.
{"title":"Looped fundamental group of weighted graphs","authors":"Sahawat Wongkhunen, Pongdate Montagantirud","doi":"10.1007/s13370-025-01376-9","DOIUrl":"10.1007/s13370-025-01376-9","url":null,"abstract":"<div><p>In recent years, the notions of discrete homotopy for graphs, such as <i>A</i>-homotopy and <span>(times)</span>-homotopy fundamental groupoid for graphs, have been introduced. This paper develops the notion of a looped fundamental groupoid for graphs to the isotropy group of the vertex <i>v</i> in the fundamental groupoid. We show that it is similar to the classical fundamental group of a topological space and the <i>A</i>-theory of graphs in some sense. Then, we generalize the concept of this theory to the looped fundamental group of weighted reflexive graphs and investigate some properties for the classification of weighted reflexive graphs in various situations. Moreover, we show that it satisfies the Seifert–Van Kampen property, with analogous results similar to the classical theory. Finally, we discuss the conclusion, its applications in the real world, and future works.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 4","pages":""},"PeriodicalIF":0.7,"publicationDate":"2025-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145062213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}