首页 > 最新文献

数学最新文献

英文 中文
IF:
Dynamical localization for finitely differentiable quasi-periodic long-range operators
IF 2.4 2区 数学 Q1 MATHEMATICS Pub Date : 2025-02-11 DOI: 10.1016/j.jde.2025.02.012
Yuan Shan
In this paper, we establish the s-power law dynamical localization for a class of finitely differentiable quasi-periodic long-range operators on 2(Zd) with Diophantine frequencies. This result represents the strongest form of dynamical localization in the setting of finitely differentiable topology which is a generalization of exponential dynamical localization in expectation in the analytic case. Our approach is based on the Aubry duality and quantitative reducibility theorem of the finitely differentiable SL(2,R) quasi-periodic cocycles in the local regime. The s-power law dynamical localization discussed here also demonstrates strong ballistic transport for finitely differentiable quasi-periodic Schrödinger operators.
{"title":"Dynamical localization for finitely differentiable quasi-periodic long-range operators","authors":"Yuan Shan","doi":"10.1016/j.jde.2025.02.012","DOIUrl":"10.1016/j.jde.2025.02.012","url":null,"abstract":"<div><div>In this paper, we establish the <em>s</em>-power law dynamical localization for a class of finitely differentiable quasi-periodic long-range operators on <span><math><msup><mrow><mi>ℓ</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>(</mo><msup><mrow><mi>Z</mi></mrow><mrow><mi>d</mi></mrow></msup><mo>)</mo></math></span> with Diophantine frequencies. This result represents the strongest form of dynamical localization in the setting of finitely differentiable topology which is a generalization of exponential dynamical localization in expectation in the analytic case. Our approach is based on the Aubry duality and quantitative reducibility theorem of the finitely differentiable <span><math><mtext>SL</mtext><mo>(</mo><mn>2</mn><mo>,</mo><mi>R</mi><mo>)</mo></math></span> quasi-periodic cocycles in the local regime. The <em>s</em>-power law dynamical localization discussed here also demonstrates strong ballistic transport for finitely differentiable quasi-periodic Schrödinger operators.</div></div>","PeriodicalId":15623,"journal":{"name":"Journal of Differential Equations","volume":"427 ","pages":"Pages 803-826"},"PeriodicalIF":2.4,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143378525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Finite difference analysis of turbulent nanofluid and heat fluctuation with oscillatory radiation, gravity and Darcy-Forchheimer porous medium via vertical cone
IF 5.3 1区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-02-11 DOI: 10.1016/j.chaos.2025.116126
Serhan Alshammari , Zia Ullah , Md. Mahbub Alam , Ahmed Osman Ibrahim , Haifa Youssef Hamdoun , Hanaa Abu-Zinadah
The transient mixed convection analysis of heat and mass transport of Darcy Forchheimer nanofluid flow over a thermal vertical cone in combustion engine cylinder with gravity modulation, nonlinear solar radiations and buoyancy force effects is the objective present phenomenon. In the study of frequency and amplitude of heat transfer, the periodic gravity modulation is significant. The gravity modulation is used under high temperature and density of nanoparticles. Brownian movement and thermophoretic slip mechanisms of nanofluid are utilized. The effects of gravity modulation, radiations and buoyancy on the frequency of heat and mass oscillations are deduced. The convenient form of governing equations is used with dimensionless coefficients. Oscillatory and steady models are solved with primitive and transient stokes factors. Heat/mass transport in steady and oscillatory form is recorded using implicit finite-difference scheme (IFDS) numerically and geometrically through FORTRAN and Tec-plot360 programs. In both oscillatory and steady analysis, the gravity modulation (RG), radiation (Rd), thermophoresis (NT), Schmidt index (Sc), Prandtl (Pr) and Brownian motion (NB) effects on fluctuating-heat and oscillatory-mass rate is reported. Magnitude of nanofluid velocity is enhanced well for maximum microgravity, radiations and buoyancy effects. Steady mass/heat transport is increased for higher thermophoretic and Forchheimer values. Increasing rate in fluctuations of periodic heating and periodic-mass rates is construed with greater magnitude for maximum Prandtl and Schmidt dynamics. Minimum layers of fluctuations in skin friction and heat transport are sketched for small Schmidt factor. The magnitude of streamlines is enhanced for lower choice of Darcy Forchheimer porous medium but magnitude of isothermal line increases as Darcy Forchheimer parameter increases.
{"title":"Finite difference analysis of turbulent nanofluid and heat fluctuation with oscillatory radiation, gravity and Darcy-Forchheimer porous medium via vertical cone","authors":"Serhan Alshammari ,&nbsp;Zia Ullah ,&nbsp;Md. Mahbub Alam ,&nbsp;Ahmed Osman Ibrahim ,&nbsp;Haifa Youssef Hamdoun ,&nbsp;Hanaa Abu-Zinadah","doi":"10.1016/j.chaos.2025.116126","DOIUrl":"10.1016/j.chaos.2025.116126","url":null,"abstract":"<div><div>The transient mixed convection analysis of heat and mass transport of Darcy Forchheimer nanofluid flow over a thermal vertical cone in combustion engine cylinder with gravity modulation, nonlinear solar radiations and buoyancy force effects is the objective present phenomenon. In the study of frequency and amplitude of heat transfer, the periodic gravity modulation is significant. The gravity modulation is used under high temperature and density of nanoparticles. Brownian movement and thermophoretic slip mechanisms of nanofluid are utilized. The effects of gravity modulation, radiations and buoyancy on the frequency of heat and mass oscillations are deduced. The convenient form of governing equations is used with dimensionless coefficients. Oscillatory and steady models are solved with primitive and transient stokes factors. Heat/mass transport in steady and oscillatory form is recorded using implicit finite-difference scheme (IFDS) numerically and geometrically through FORTRAN and Tec-plot360 programs. In both oscillatory and steady analysis, the gravity modulation (<span><math><msub><mi>R</mi><mi>G</mi></msub></math></span>), radiation (<span><math><msub><mi>R</mi><mi>d</mi></msub></math></span>), thermophoresis (<span><math><msub><mi>N</mi><mi>T</mi></msub></math></span>), Schmidt index (<span><math><msub><mi>S</mi><mi>c</mi></msub></math></span>), Prandtl (<em>Pr</em>) and Brownian motion (<span><math><msub><mi>N</mi><mi>B</mi></msub></math></span>) effects on fluctuating-heat and oscillatory-mass rate is reported. Magnitude of nanofluid velocity is enhanced well for maximum microgravity, radiations and buoyancy effects. Steady mass/heat transport is increased for higher thermophoretic and Forchheimer values. Increasing rate in fluctuations of periodic heating and periodic-mass rates is construed with greater magnitude for maximum Prandtl and Schmidt dynamics. Minimum layers of fluctuations in skin friction and heat transport are sketched for small Schmidt factor. The magnitude of streamlines is enhanced for lower choice of Darcy Forchheimer porous medium but magnitude of isothermal line increases as Darcy Forchheimer parameter increases.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"193 ","pages":"Article 116126"},"PeriodicalIF":5.3,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143378662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On a blow-up criterion for the Navier–Stokes–Fourier system under general equations of state
IF 1.8 3区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2025-02-11 DOI: 10.1016/j.nonrwa.2025.104328
Anna Abbatiello , Danica Basarić , Nilasis Chaudhuri
In this paper we prove a blow-up criterion for the compressible Navier–Stokes-Fourier system for general thermal and caloric equations of state with inhomogeneous boundary conditions for the velocity and the temperature. Assuming only that Gibb’s equation and the thermodynamic stability hold, we show that solutions in a certain regularity class remain regular under the condition that the density, the temperature and the modulus of the velocity are bounded.
{"title":"On a blow-up criterion for the Navier–Stokes–Fourier system under general equations of state","authors":"Anna Abbatiello ,&nbsp;Danica Basarić ,&nbsp;Nilasis Chaudhuri","doi":"10.1016/j.nonrwa.2025.104328","DOIUrl":"10.1016/j.nonrwa.2025.104328","url":null,"abstract":"<div><div>In this paper we prove a blow-up criterion for the compressible Navier–Stokes-Fourier system for general thermal and caloric equations of state with inhomogeneous boundary conditions for the velocity and the temperature. Assuming only that Gibb’s equation and the thermodynamic stability hold, we show that solutions in a certain regularity class remain regular under the condition that the density, the temperature and the modulus of the velocity are bounded.</div></div>","PeriodicalId":49745,"journal":{"name":"Nonlinear Analysis-Real World Applications","volume":"84 ","pages":"Article 104328"},"PeriodicalIF":1.8,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143379227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An extended hypergraph cut method for the Wiener index
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-02-11 DOI: 10.1016/j.dam.2025.02.003
Gašper Domen Romih
The cut method for the Wiener index of k-uniform partial cube hypergraphs was recently proposed. This paper introduces a method for the non-uniform case. The method is also extended to some non-uniform and non-linear hypergraphs which are not partial cube hypergraphs. The extended method is applied to cube hypergraphs, hypertrees and phenylene hypergraphs.
{"title":"An extended hypergraph cut method for the Wiener index","authors":"Gašper Domen Romih","doi":"10.1016/j.dam.2025.02.003","DOIUrl":"10.1016/j.dam.2025.02.003","url":null,"abstract":"<div><div>The cut method for the Wiener index of <span><math><mi>k</mi></math></span>-uniform partial cube hypergraphs was recently proposed. This paper introduces a method for the non-uniform case. The method is also extended to some non-uniform and non-linear hypergraphs which are not partial cube hypergraphs. The extended method is applied to cube hypergraphs, hypertrees and phenylene hypergraphs.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"367 ","pages":"Pages 80-88"},"PeriodicalIF":1.0,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143378804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the nontrivial extremal eigenvalues of graphs
IF 0.7 3区 数学 Q2 MATHEMATICS Pub Date : 2025-02-11 DOI: 10.1016/j.disc.2025.114423
Wenbo Li, Shiping Liu
We present improved bounds on a quantitative version of an observation originally due to Breuillard, Green, Guralnick and Tao which says that for finite non-bipartite Cayley graphs, once the nontrivial eigenvalues of their normalized adjacency matrices are uniformly bounded away from 1, then they are also uniformly bounded away from −1. Unlike previous works which depend heavily on combinatorial arguments, we rely more on analysis of eigenfunctions. We establish a new explicit lower bound for the gap between −1 and the smallest normalized adjacency eigenvalue, which improves previous lower bounds in terms of edge-expansion, and is comparable to the best known lower bound in terms of vertex-expansion.
{"title":"On the nontrivial extremal eigenvalues of graphs","authors":"Wenbo Li,&nbsp;Shiping Liu","doi":"10.1016/j.disc.2025.114423","DOIUrl":"10.1016/j.disc.2025.114423","url":null,"abstract":"<div><div>We present improved bounds on a quantitative version of an observation originally due to Breuillard, Green, Guralnick and Tao which says that for finite non-bipartite Cayley graphs, once the nontrivial eigenvalues of their normalized adjacency matrices are uniformly bounded away from 1, then they are also uniformly bounded away from −1. Unlike previous works which depend heavily on combinatorial arguments, we rely more on analysis of eigenfunctions. We establish a new explicit lower bound for the gap between −1 and the smallest normalized adjacency eigenvalue, which improves previous lower bounds in terms of edge-expansion, and is comparable to the best known lower bound in terms of vertex-expansion.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 6","pages":"Article 114423"},"PeriodicalIF":0.7,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143378565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Read‐Shockley energy for grain boundaries in 2D polycrystals
IF 3 1区 数学 Q1 MATHEMATICS Pub Date : 2025-02-11 DOI: 10.1002/cpa.22245
Martino Fortuna, Adriana Garroni, Emanuele Spadaro
In the 50's Read and Shockley proposed a formula for the energy of small angle grain boundaries in polycrystals based on linearized elasticity and an ansatz on the distribution of incompatibilities of the lattice at the interface between two grains. The logarithmic scaling of this formula has been rigorously justified without any ansatz on the geometry of dislocations only recently in an article by Lauteri and Luckhaus. In the present paper, building upon their analysis, we derive a two dimensional sharp interface limiting functional starting from the nonlinear semi‐discrete model introduced in Lauteri and Luckhaus: the line tension we obtain via ‐convergence depends on the rotations of the grains and the relative orientations of the interfaces, and for small angle grain boundaries has the Read and Shockley logarithmic scaling.
{"title":"On the Read‐Shockley energy for grain boundaries in 2D polycrystals","authors":"Martino Fortuna, Adriana Garroni, Emanuele Spadaro","doi":"10.1002/cpa.22245","DOIUrl":"https://doi.org/10.1002/cpa.22245","url":null,"abstract":"In the 50's Read and Shockley proposed a formula for the energy of small angle grain boundaries in polycrystals based on linearized elasticity and an ansatz on the distribution of incompatibilities of the lattice at the interface between two grains. The logarithmic scaling of this formula has been rigorously justified without any ansatz on the geometry of dislocations only recently in an article by Lauteri and Luckhaus. In the present paper, building upon their analysis, we derive a two dimensional sharp interface limiting functional starting from the nonlinear semi‐discrete model introduced in Lauteri and Luckhaus: the line tension we obtain via ‐convergence depends on the rotations of the grains and the relative orientations of the interfaces, and for small angle grain boundaries has the Read and Shockley logarithmic scaling.","PeriodicalId":10601,"journal":{"name":"Communications on Pure and Applied Mathematics","volume":"13 1","pages":""},"PeriodicalIF":3.0,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143384980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
New insights on fractal–fractional integral inequalities: Hermite–Hadamard and Milne estimates
IF 5.3 1区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-02-11 DOI: 10.1016/j.chaos.2025.116087
Abdelghani Lakhdari , Hüseyin Budak , Nabil Mlaiki , Badreddine Meftah , Thabet Abdeljawad
This paper investigates fractal–fractional integral inequalities for generalized s-convex functions. We begin by establishing a fractal–fractional Hermite–Hadamard inequality for such functions. In addition, a novel identity is introduced, which serves as the basis for deriving some fractal–fractional Milne-type inequalities for functions whose first-order local fractional derivatives exhibit generalized s-convexity. Subsequently, we provide additional results using the improved generalized Hölder and power mean inequalities, followed by a numerical example with graphical representations that confirm the accuracy of the obtained results. The study concludes with several applications to demonstrate the practicality and relevance of the proposed inequalities in various settings.
{"title":"New insights on fractal–fractional integral inequalities: Hermite–Hadamard and Milne estimates","authors":"Abdelghani Lakhdari ,&nbsp;Hüseyin Budak ,&nbsp;Nabil Mlaiki ,&nbsp;Badreddine Meftah ,&nbsp;Thabet Abdeljawad","doi":"10.1016/j.chaos.2025.116087","DOIUrl":"10.1016/j.chaos.2025.116087","url":null,"abstract":"<div><div>This paper investigates fractal–fractional integral inequalities for generalized <span><math><mi>s</mi></math></span>-convex functions. We begin by establishing a fractal–fractional Hermite–Hadamard inequality for such functions. In addition, a novel identity is introduced, which serves as the basis for deriving some fractal–fractional Milne-type inequalities for functions whose first-order local fractional derivatives exhibit generalized <span><math><mi>s</mi></math></span>-convexity. Subsequently, we provide additional results using the improved generalized Hölder and power mean inequalities, followed by a numerical example with graphical representations that confirm the accuracy of the obtained results. The study concludes with several applications to demonstrate the practicality and relevance of the proposed inequalities in various settings.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"193 ","pages":"Article 116087"},"PeriodicalIF":5.3,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143378661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Non-trivial r-wise agreeing families
IF 1 3区 数学 Q1 MATHEMATICS Pub Date : 2025-02-11 DOI: 10.1016/j.ejc.2025.104129
Peter Frankl , Andrey Kupavskii
A family of subsets of [n] is r-wise agreeing if for any r sets from the family there is an element x that is either contained in all or contained in none of the r sets. The study of such families is motivated by questions in discrete optimization. In this paper, we determine the size of the largest non-trivial r-wise agreeing family. This can be seen as a generalization of the classical Brace–Daykin theorem.
{"title":"Non-trivial r-wise agreeing families","authors":"Peter Frankl ,&nbsp;Andrey Kupavskii","doi":"10.1016/j.ejc.2025.104129","DOIUrl":"10.1016/j.ejc.2025.104129","url":null,"abstract":"<div><div>A family of subsets of <span><math><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></math></span> is <span><math><mi>r</mi></math></span>-wise agreeing if for any <span><math><mi>r</mi></math></span> sets from the family there is an element <span><math><mi>x</mi></math></span> that is either contained in all or contained in none of the <span><math><mi>r</mi></math></span> sets. The study of such families is motivated by questions in discrete optimization. In this paper, we determine the size of the largest non-trivial <span><math><mi>r</mi></math></span>-wise agreeing family. This can be seen as a generalization of the classical Brace–Daykin theorem.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"126 ","pages":"Article 104129"},"PeriodicalIF":1.0,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143378443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the recovery of two function-valued coefficients in the Helmholtz equation for inverse scattering problems via neural networks
IF 1.7 3区 数学 Q2 MATHEMATICS, APPLIED Pub Date : 2025-02-11 DOI: 10.1007/s10444-025-10225-z
Zehui Zhou

Recently, deep neural networks (DNNs) have become powerful tools for solving inverse scattering problems. However, the approximation and generalization rates of DNNs for solving these problems remain largely under-explored. In this work, we introduce two types of combined DNNs (uncompressed and compressed) to reconstruct two function-valued coefficients in the Helmholtz equation for inverse scattering problems from the scattering data at two different frequencies. An analysis of the approximation and generalization capabilities of the proposed neural networks for simulating the regularized pseudo-inverses of the linearized forward operators in direct scattering problems is provided. The results show that, with sufficient training data and parameters, the proposed neural networks can effectively approximate the inverse process with desirable generalization. Preliminary numerical results show the feasibility of the proposed neural networks for recovering two types of isotropic inhomogeneous media. Furthermore, the trained neural network is capable of reconstructing the isotropic representation of certain types of anisotropic media.

{"title":"On the recovery of two function-valued coefficients in the Helmholtz equation for inverse scattering problems via neural networks","authors":"Zehui Zhou","doi":"10.1007/s10444-025-10225-z","DOIUrl":"10.1007/s10444-025-10225-z","url":null,"abstract":"<div><p>Recently, deep neural networks (DNNs) have become powerful tools for solving inverse scattering problems. However, the approximation and generalization rates of DNNs for solving these problems remain largely under-explored. In this work, we introduce two types of combined DNNs (uncompressed and compressed) to reconstruct two function-valued coefficients in the Helmholtz equation for inverse scattering problems from the scattering data at two different frequencies. An analysis of the approximation and generalization capabilities of the proposed neural networks for simulating the regularized pseudo-inverses of the linearized forward operators in direct scattering problems is provided. The results show that, with sufficient training data and parameters, the proposed neural networks can effectively approximate the inverse process with desirable generalization. Preliminary numerical results show the feasibility of the proposed neural networks for recovering two types of isotropic inhomogeneous media. Furthermore, the trained neural network is capable of reconstructing the isotropic representation of certain types of anisotropic media.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"51 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-025-10225-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143379751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the smallest positive eigenvalue of caterpillar unicyclic graphs
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-02-11 DOI: 10.1016/j.dam.2025.02.002
Sasmita Barik, Subhasish Behera
<div><div>Let <span><math><mi>G</mi></math></span> be a simple graph with the adjacency matrix <span><math><mrow><mi>A</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span>. By the smallest positive eigenvalue of <span><math><mi>G</mi></math></span>, we mean the smallest positive eigenvalue of <span><math><mrow><mi>A</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> and denote it by <span><math><mrow><mi>τ</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span>. For <span><math><mrow><mi>k</mi><mo>≥</mo><mn>3</mn></mrow></math></span>, let <span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span> be the cycle graph with vertices <span><math><mrow><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>k</mi></mrow></math></span> and <span><math><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></math></span> be <span><math><mi>k</mi></math></span> nonnegative integers. A caterpillar unicyclic graph <span><math><mrow><msub><mrow><mi>C</mi></mrow><mrow><mi>k</mi></mrow></msub><mrow><mo>(</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>)</mo></mrow></mrow></math></span> is a graph obtained from <span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span> by adding <span><math><msub><mrow><mi>n</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> pendant vertices to the vertex <span><math><mi>i</mi></math></span> of <span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span>, for <span><math><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>k</mi></mrow></math></span>. Let <span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> be the class of all caterpillar unicyclic graphs on <span><math><mi>n</mi></math></span> vertices, where each <span><math><msub><mrow><mi>n</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> is positive. In this article, we obtain the graphs with the maximum <span><math><mi>τ</mi></math></span> among all the graphs in <span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. Furthermore, we characterize the graphs <span><math><mi>G</mi></math></span> in <span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> such that <span><math><mrow><mi>τ</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><msqrt><mrow><mn>2</mn></mrow></msqrt><mo>−</mo><mn>1</mn></mrow></math></span> and <span><math><mrow><mi>τ</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>></mo><msqrt><mrow><mn>2</mn></mrow></msqrt><mo>−</mo><
{"title":"On the smallest positive eigenvalue of caterpillar unicyclic graphs","authors":"Sasmita Barik,&nbsp;Subhasish Behera","doi":"10.1016/j.dam.2025.02.002","DOIUrl":"10.1016/j.dam.2025.02.002","url":null,"abstract":"&lt;div&gt;&lt;div&gt;Let &lt;span&gt;&lt;math&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; be a simple graph with the adjacency matrix &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;. By the smallest positive eigenvalue of &lt;span&gt;&lt;math&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;, we mean the smallest positive eigenvalue of &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; and denote it by &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;. For &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;≥&lt;/mo&gt;&lt;mn&gt;3&lt;/mn&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;, let &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; be the cycle graph with vertices &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mo&gt;…&lt;/mo&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; and &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mo&gt;…&lt;/mo&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; be &lt;span&gt;&lt;math&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; nonnegative integers. A caterpillar unicyclic graph &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mo&gt;…&lt;/mo&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; is a graph obtained from &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; by adding &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;i&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; pendant vertices to the vertex &lt;span&gt;&lt;math&gt;&lt;mi&gt;i&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; of &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt;, for &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;i&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mo&gt;…&lt;/mo&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;. Let &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; be the class of all caterpillar unicyclic graphs on &lt;span&gt;&lt;math&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; vertices, where each &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;i&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; is positive. In this article, we obtain the graphs with the maximum &lt;span&gt;&lt;math&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; among all the graphs in &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt;. Furthermore, we characterize the graphs &lt;span&gt;&lt;math&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; in &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; such that &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;msqrt&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msqrt&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; and &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mo&gt;&gt;&lt;/mo&gt;&lt;msqrt&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msqrt&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"367 ","pages":"Pages 89-98"},"PeriodicalIF":1.0,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143378805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
全部 Dokl. Math. Funct. Anal. Appl. J. Homotopy Relat. Struct. J. Math. Fluid Mech. Math. Phys. Anal. Geom. ACTA MATH APPL SIN-E Adv. Nonlinear Stud. Adv. Appl. Clifford Algebras ADV GEOM ALGEBR LOG+ Am. J. Math. Am. Math. Mon. ANN I H POINCARE-PR APPL CATEGOR STRUCT ANN STAT ANN MATH Appl. Numer. Math. Ann. Mat. Pura Appl. Ann. Global Anal. Geom. Arch. Math. Archiv. Math. Logic BIOMETRICS BIOMETRIKA Bull. Math. Sci Bull. Math. Biol. B IRAN MATH SOC Calc. Var. Partial Differ. Equations Bull. Am. Math. Soc. CALCOLO CHAOS SOLITON FRACT CHAOS COMB PROBAB COMPUT COMMUN STAT-THEOR M Commun. Math. Stat. Commun. Pure Appl. Math. C.R. Math. Commun. Pure Appl. Anal. Demonstratio Mathematica Des. Codes Cryptogr. Duke Math. J. Electron. J. Comb. FILOMAT FORUM MATH Fractal and Fractional Geom. Funct. Anal. GRAPH COMBINATOR INTEGR EQUAT OPER TH INT J ALGEBR COMPUT Interfaces Free Boundaries Int. J. Comput. Math. INT J NUMBER THEORY INVENT MATH Int. Math. Res. Not. Int. Stat. Rev. Isr. J. Math. J. Algebra J ALGEBR COMB J. Appl. Math. Comput. J. Appl. Stat. J. Comb. Des. J. Comput. Graphical Stat. J. Complex Networks J. Differ. Equations Appl. J. Differ. Equations J. Dyn. Differ. Equations J. Differ. Geom. J. Funct. Anal. J. Funct. Spaces J. Global Optim. J.Fourier Anal. Appl. J. Graph Theory J. Inequal. Appl. J. Math. Imaging Vision J. Multivar. Anal. J. Symb. Log. Journal of Survey Statistics and Methodology J. Am. Stat. Assoc. Linear Algebra Appl. Math. Z. MATH SLOVACA Math. Modell. Nat. Phenom. Math. Notes Math. Program. MATHEMATICS-BASEL Math. Ann. Math. Proc. Cambridge Philos. Soc. METHODOL COMPUT APPL Math. Comput. MATHEMATIKA Numer. Methods Partial Differ. Equations PHYSICA D Probab. Theory Relat. Fields Proc. Edinburgh Math. Soc. Proc. Am. Math. Soc. Q. Appl. Math. Ric. Mat. Stochastic Models STAT COMPUT TAIWAN J MATH TOPOL METHOD NONL AN
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1