<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>17</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Vertex-Degree Function Index of Hypergraphs with Given Independence Number</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>329</FirstPage>
			<LastPage>338</LastPage>
			<ELocationID EIdType="pii">115887</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2026.258204.2110</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Shashwath S</FirstName>
					<LastName>Shetty</LastName>
<Affiliation>Manipal Institute of Technology‎, ‎Manipal Academy of Higher Education‎, ‎Manipal‎, ‎India</Affiliation>

</Author>
<Author>
					<FirstName>Arathi K</FirstName>
					<LastName>Bhat</LastName>
<Affiliation>Manipal Institute of Technology‎, ‎Manipal Academy of Higher Education‎, ‎Manipal‎, ‎India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>31</Day>
				</PubDate>
			</History>
		<Abstract>‎Hypergraphs generalize graphs by permitting edges to link arbitrary numbers of vertices‎, ‎making them increasingly important for modeling complex networks‎. ‎Topological indices for hypergraphs offer critical insights into their structural properties and complexity‎, ‎with broad applications in network theory‎, ‎chemistry‎, ‎and data science‎. This paper focuses on the vertex-degree function index of hypergraphs characterized by a fixed independence number‎. ‎We establish bounds for this index‎, ‎generalizing classical results from graph theory to hypergraphs‎. ‎Specifically‎, ‎we determine upper and lower bounds for the vertex-degree function index‎, ‎assuming convexity in hypertrees and unicyclic hypergraphs and fixing their independence number‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Vertex-degree</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Independence number</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Hypertrees</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Unicyclic hypergraphs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Quality education</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_115887_37f0f323659381a4d369301768a71439.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>17</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the Analytic Solution for the Surface Concentration and‎ ‎Impedance‎ ‎in AC Experiments‎ ‎at Circular‎ ‎Disk Electrodes</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>339</FirstPage>
			<LastPage>362</LastPage>
			<ELocationID EIdType="pii">115889</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2026.258174.2107</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Stanley</FirstName>
					<LastName>Pons</LastName>
<Affiliation>Department of Chemistry‎, ‎University of Utah‎, ‎Salt Lake City‎, ‎UT 84112‎, ‎USA‎, ‎and Pons(EI)‎, ‎14‎, ‎rue Eugene Giraud‎, ‎06560 Valbonne‎, ‎France</Affiliation>
<Identifier Source="ORCID">0000-0002-6725-4713</Identifier>

</Author>
<Author>
					<FirstName>Tibor</FirstName>
					<LastName>Pogany</LastName>
<Affiliation>Institute of Applied Mathematics‎, ‎\'Obuda University‎, ‎1034 Budapest‎, ‎B\'ecsi \'ut 96/b‎, ‎Hungary‎, ‎and Faculty of Maritime Studies‎, ‎University of Rijeka‎, ‎51000 Rijeka‎, ‎Studentska 2‎, ‎Croatia</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>22</Day>
				</PubDate>
			</History>
		<Abstract>‎This work presents an exact analytical solution for the time-dependent concentration of an electroactive species at a circular disk electrode under a periodic flux‎. ‎The solution is derived using a complete Laplace transform treatment of the diffusion equation‎, ‎yielding a closed-form expression for the steady state and an exact analytical representation for the transient regime‎. ‎The steady-state solution is expressed in terms of a modified Struve function of the second kind‎, ‎${\bf M}_1(z)$‎, ‎thereby eliminating the need for numerical integration of Bessel functions‎. ‎The transient solution‎, ‎given in terms of Fresnel integrals and modified Bessel functions‎, ‎explicitly captures the temporal behavior from t=0 to steady state‎. ‎Critically‎, ‎this work demonstrates that the transient component‎, ‎previously treated as a correction or simply ignored‎, ‎contains independent information about the diffusion coefficient D and electrode radius a‎. ‎This information can be extracted from a single experimental measurement‎. ‎The complex impedance components‎, ‎directly derived from the steady-state solution‎, ‎provide an alternative to traditional integral-based formulations‎. ‎The analytical framework introduced here enables rapid parameter extraction‎, ‎sensitivity analysis‎, ‎and optimal experimental design‎, ‎all of which are inaccessible to purely numerical approaches‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Electrochemical impedance</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Modified Struve function</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Diffusion equation</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_115889_8aacce4e992ff9aa2fde1ce630ed965c.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>17</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Extremal $\alpha$-Sum of the Randi\&#039;c Index and its Reciprocal in Small k-Uniform Hypertrees</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>363</FirstPage>
			<LastPage>380</LastPage>
			<ELocationID EIdType="pii">115891</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2026.258426.2121</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Nelson</FirstName>
					<LastName>Berrocal Huamani</LastName>
<Affiliation>Department of Mathematics and Physics‎, ‎Universidad Nacional de San Crist\'obal de Huamanga‎, ‎Ayacucho‎, ‎Per\'u</Affiliation>
<Identifier Source="ORCID">0000-0001-8554-3503</Identifier>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2026</Year>
					<Month>02</Month>
					<Day>17</Day>
				</PubDate>
			</History>
		<Abstract>‎For $\alpha&gt;0$ we study a Randi\&#039;c-type functional on $k$-uniform hypergraphs‎,‎ $\Phi_\alpha(H)=\sum_{e\in E(H)}\Big(P_H(e)^{\alpha/2}+P_H(e)^{\alpha/2}\Big), ‎P_H(e)=\prod_{v\in e} d_H(v)‎,$‎‎which extends Gao’s $(\mathrm R+\mathrm{RR})$ at $\alpha=1$‎. We prove that splitting a (redundant) intersection strictly decreases $\Phi_\alpha$ for every $\alpha&gt;0$‎, and deduce a sharp maximum with fixed order $n$‎: ‎among simple connected $k$-uniform hypergraphs on $n$ vertices‎, $\Phi_\alpha$ is uniquely maximized by the complete hypergraph $K_n^{(k)}$‎. We then study minimizers on small $k$-uniform hypertrees‎, where $m=|E(H)|$ denotes the number of hyperedges‎. For $m=3$ hyperedges‎, ‎there is a unique threshold $\alpha_0\approx 6.1412175821$ where the minimizer switches from the linear hyperpath $P_{3,k}$‎ to the sunflower $S(3,1,k)$ (with both extremal at $\alpha=\alpha_0$)‎. For m=4 no transition occurs‎: ‎$P_{4,k}$ is the unique minimizer for all $\alpha&gt;0$‎. Finally‎, ‎we show a barrier at $\alpha=4$‎: ‎for $\alpha&gt;4$ branching can decrease $\Phi_\alpha$‎, ‎invalidating direct pendent-path merging‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">topological index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Degree product</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Intersection splitting</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Threshold phenomenon</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Minimizer characterization</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_115891_cac1da2793d42885c76c720ae4b664e2.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>17</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>The Generalized Energy of Matrix</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>381</FirstPage>
			<LastPage>399</LastPage>
			<ELocationID EIdType="pii">115896</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2026.257563.2063</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Abbas</FirstName>
					<LastName>Mousavi Nejad</LastName>
<Affiliation>Department of Mathematics‎, ‎Tafresh University‎, ‎Tafresh 39518-79611‎, ‎Iran</Affiliation>

</Author>
<Author>
					<FirstName>Hasan</FirstName>
					<LastName>Barzegar</LastName>
<Affiliation>Department of Mathematics‎, ‎Tafresh University‎, ‎Tafresh 39518-79611‎, ‎Iran</Affiliation>
<Identifier Source="ORCID">0000-0002-8916-7733</Identifier>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>09</Month>
					<Day>11</Day>
				</PubDate>
			</History>
		<Abstract>‎The adjacency matrix is one of the fundamental tools in graph theory‎, ‎providing a link between a graph&#039;s combinatorial structure and its algebraic properties‎. ‎In this paper‎, ‎we present a generalization of the adjacency matrix for simple weighted graphs based on an arbitrary weight function‎, ‎while preserving the essential structure of the classical weighted adjacency matrix‎. ‎Furthermore‎, ‎this framework extends naturally to encompass new graph-theoretical concepts‎, ‎such as graph energy‎, ‎and provides a comprehensive and flexible foundation for the deeper investigation of simple weighted graphs‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Generalized adjacency matrix</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Generalized graph energy</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Symmetric division degree function</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_115896_3e1a813196d7bfc007bedb02c7956842.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>17</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the Inverse Sum Indeg Index and its Associated Energy</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>401</FirstPage>
			<LastPage>414</LastPage>
			<ELocationID EIdType="pii">115903</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2026.257236.2033</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Slobodan</FirstName>
					<LastName>Filipovski</LastName>
<Affiliation>Faculty of Mathematics‎, ‎Natural Sciences and Information Technologies‎, ‎University of Primorska‎, ‎Glagolja\v{s}ka 8‎, ‎SI-6000 Koper‎, ‎Slovenia</Affiliation>
<Identifier Source="ORCID">0000-0002-7286-4954</Identifier>

</Author>
<Author>
					<FirstName>‎Mirza</FirstName>
					<LastName>Red\v{z}i\'c</LastName>
<Affiliation>Karlsruhe Institute of Technology (KIT)‎,
‎76131 Karlsruhe‎, ‎Germany</Affiliation>

</Author>
<Author>
					<FirstName>Elvis</FirstName>
					<LastName>Barakovi\'c</LastName>
<Affiliation>Faculty of Natural Sciences and Mathematics‎,
‎University of Tuzla‎, ‎Univerzitetska 4‎, ‎75000 Tuzla‎,
‎Bosnia and Herzegovina</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>09</Month>
					<Day>17</Day>
				</PubDate>
			</History>
		<Abstract>‎Let G be a simple graph with degree sequence $\{d_v\}$‎. ‎The inverse sum indeg (ISI) matrix S is defined by‎ $s_{uv} = \frac{d_u d_v}{d_u‎ + ‎d_v}$ if $uv \in E(G)$ and 0 otherwise‎. ‎The ISI energy of G is defined as‎ $\mathcal{E}_{ISI}(G) = \sum_{i=1}^n |\tau_i|$‎, ‎where $\tau_1,\dots,\tau_n$ are the eigenvalues of S. In this paper‎, ‎we establish new upper and lower bounds for the ISI index and ISI energy in terms of classical degree-based‎ graph invariants‎, ‎including the second Zagreb index‎, ‎geometric–arithmetic index‎, ‎harmonic index‎, ‎Sombor index‎, ‎and Randić index‎. Several of these results refine and improve the classical estimate $\mathcal{E}_{ISI}(G) \le \sqrt{2nB}$‎, ‎where‎ $B = \sum_{uv\in E(G)} \left(\frac{d_u d_v}{d_u‎ + ‎d_v}\right)^2$‎. We further derive spectral refinements involving extremal eigenvalues and the variance of the squared eigenvalues, and recall known determinant-based bounds. ‎In addition‎, ‎we obtain new bounds for the largest eigenvalue of S and establish further relations between ISI energy and‎ structural molecular descriptors‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Inverse sum indeg index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">ISI energy</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Degree-based topological indices</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Spectral graph theory</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Graph energy</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_115903_edb9847eabfa6be991e6727752bf86a9.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>17</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>An Innovative Numerical Approach for Solving Two-Dimensional Helmholtz Problem</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>415</FirstPage>
			<LastPage>437</LastPage>
			<ELocationID EIdType="pii">115913</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2026.258327.2112</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Soheila</FirstName>
					<LastName>Heidari</LastName>
<Affiliation>Department of Mathematics‎, ‎Babol Noshirvani University of Technology‎, ‎Babol‎, ‎Iran</Affiliation>

</Author>
<Author>
					<FirstName>Mahmoud</FirstName>
					<LastName>Behroozifar</LastName>
<Affiliation>Department of Mathematics‎, ‎Babol Noshirvani University of Technology‎, ‎Babol‎, ‎Iran</Affiliation>
<Identifier Source="ORCID">0000-0002-6885-0218</Identifier>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2026</Year>
					<Month>02</Month>
					<Day>02</Day>
				</PubDate>
			</History>
		<Abstract>‎This paper proposes a new spectral approach for the two-dimensional Helmholtz equation with Dirichlet boundary conditions‎. ‎We construct a closed-form two-dimensional generalized interpolation function that exactly satisfies arbitrary (non-homogeneous) boundary data‎, ‎reducing the original problem to an equivalent one with homogeneous boundary conditions‎. ‎To approximate the homogenized problem‎, ‎we introduce a two-variable family of homogenizing Gegenbauer polynomials (HGPs) that vanish identically on the domain boundary‎, ‎and show that the resulting basis is semi-orthogonal with a banded (pentadiagonal) Gram matrix‎, ‎preserving the computational efficiency of spectral methods‎. ‎A Galerkin discretization then reduces the problem to a system of algebraic equations‎. ‎We derive an explicit upper bound on the approximation error and prove a spectral (exponential) convergence rate for analytic solutions‎. ‎Eight benchmark problems‎ - ‎including Helmholtz and Poisson equations with separable and non-separable exact solutions‎, ‎constant and variable coefficients‎, ‎and a classical torsion-problem benchmark‎ - ‎are used to assess accuracy‎, ‎stability under boundary and source-term perturbations‎, ‎and CPU efficiency‎. ‎The proposed method achieves low RMSE values with low polynomial degree $(M \leq 4)$ and modest CPU time‎, ‎and compares favorably with existing finite element‎, ‎finite difference‎, ‎and spectral element approaches reported in the literature‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Helmholtz problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Homogenizing Gegenbauer polynomials</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Generalized interpolation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Spectral method</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Non-homogeneous boundary conditions</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_115913_54726a068aeb98c17a2c7d272e1299eb.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
