The purpose of the article is to investigate Dirichlet boundary-value problems of the fractional p-Laplacian equation with impulsive effects. By using the Nehari manifold method, mountain pass theorem and three critical points theorem, some new results are achieved under more general growth conditions. In addition, this paper weakens the commonly used p-suplinear and p-sublinear growth conditions.
Citation: Xiaolin Fan, Tingting Xue, Yongsheng Jiang. Dirichlet problems of fractional p-Laplacian equation with impulsive effects[J]. Mathematical Biosciences and Engineering, 2023, 20(3): 5094-5116. doi: 10.3934/mbe.2023236
[1] | Edil D. Molina, Paul Bosch, José M. Sigarreta, Eva Tourís . On the variable inverse sum deg index. Mathematical Biosciences and Engineering, 2023, 20(5): 8800-8813. doi: 10.3934/mbe.2023387 |
[2] | V. R. Kulli, J. A. Méndez-Bermúdez, José M. Rodríguez, José M. Sigarreta . Revan Sombor indices: Analytical and statistical study. Mathematical Biosciences and Engineering, 2023, 20(2): 1801-1819. doi: 10.3934/mbe.2023082 |
[3] | Xinlin Liu, Viktor Krylov, Su Jun, Natalya Volkova, Anatoliy Sachenko, Galina Shcherbakova, Jacek Woloszyn . Segmentation and identification of spectral and statistical textures for computer medical diagnostics in dermatology. Mathematical Biosciences and Engineering, 2022, 19(7): 6923-6939. doi: 10.3934/mbe.2022326 |
[4] | A. Newton Licciardi Jr., L.H.A. Monteiro . A network model of social contacts with small-world and scale-free features, tunable connectivity, and geographic restrictions. Mathematical Biosciences and Engineering, 2024, 21(4): 4801-4813. doi: 10.3934/mbe.2024211 |
[5] | Qingqun Huang, Muhammad Labba, Muhammad Azeem, Muhammad Kamran Jamil, Ricai Luo . Tetrahedral sheets of clay minerals and their edge valency-based entropy measures. Mathematical Biosciences and Engineering, 2023, 20(5): 8068-8084. doi: 10.3934/mbe.2023350 |
[6] | Wenjuan Guo, Ming Ye, Xining Li, Anke Meyer-Baese, Qimin Zhang . A theta-scheme approximation of basic reproduction number for an age-structured epidemic system in a finite horizon. Mathematical Biosciences and Engineering, 2019, 16(5): 4107-4121. doi: 10.3934/mbe.2019204 |
[7] | J. A. Méndez-Bermúdez, José M. Rodríguez, José L. Sánchez, José M. Sigarreta . Analytical and computational properties of the variable symmetric division deg index. Mathematical Biosciences and Engineering, 2022, 19(9): 8908-8922. doi: 10.3934/mbe.2022413 |
[8] | Jair Castro, Ludwin A. Basilio, Gerardo Reyna, Omar Rosario . The differential on operator S(Γ). Mathematical Biosciences and Engineering, 2023, 20(7): 11568-11584. doi: 10.3934/mbe.2023513 |
[9] | Cheng-Peng Li, Cheng Zhonglin, Mobeen Munir, Kalsoom Yasmin, Jia-bao Liu . M-polynomials and topological indices of linear chains of benzene, napthalene and anthracene. Mathematical Biosciences and Engineering, 2020, 17(3): 2384-2398. doi: 10.3934/mbe.2020127 |
[10] | Muhammad Akram, Saba Siddique, Majed G. Alharbi . Clustering algorithm with strength of connectedness for m-polar fuzzy network models. Mathematical Biosciences and Engineering, 2022, 19(1): 420-455. doi: 10.3934/mbe.2022021 |
The purpose of the article is to investigate Dirichlet boundary-value problems of the fractional p-Laplacian equation with impulsive effects. By using the Nehari manifold method, mountain pass theorem and three critical points theorem, some new results are achieved under more general growth conditions. In addition, this paper weakens the commonly used p-suplinear and p-sublinear growth conditions.
Let G be graph having vertex set V=V(G) and edge set E=E(G), then the adjacency matrix associated to the graph G, is
[A(G)]={1 if vi is adjacent to vj,0 otherwise. |
Sum of absolute values of the eigenvalues associated to A(G) is known as energy of the graph G denoted by E(G) and the Largest eigenvalue of A(G) is called Spectral radius of the graph G and it is denoted by ℘(G). For details and references relating to Spectral radii, follow [2,3,4]. The motivation of E(G) was initiated by Gutman in 1978 [1] but the idea could not get attention until 2000. Since 2003, rapid development in technology and computer awoke significant interests in these areas. The problem of determining extreme values of spectral radius has been extensively investigated, [5]. Partial solutions to these problems can be traced in [6,7,8,9,10,11]. Fiedler and Nikiforov [6] gave tight sufficient conditions for the existence of Hamilton paths and cycles in terms of the spectral radius of graphs or the complement of graphs. Lu et al. [7] studied sufficient conditions for Hamilton paths in connected graphs and Hamilton cycles in bipartite graphs in terms of the spectral radius of a graph. Some other spectral conditions for Hamilton paths and cycles in graphs have been given in [12,13,14,15,16].
Horn et al.[17] and Gatmacher [18] used matrix analysis to relate it with graph energies. Balkrishnan, in [19], computed the sharp bounds for energy of a k-regular graph and proved that for n≥3, there always exists two equi-energetic graphs having order 4n which are not co-spectral. Bapat et al. proved that E(G) can not be an odd integer, [20] whereas Pirzada et al. [21] proved that it can not be square root of an odd integer. Jones [22] discussed E(G) of simple graphs relating it with closuring and algebraic connectivity. Different kinds of matrices energies associated to a graph are presented by Meenakshi et al. [23]. Nikiforov [24] obtained various results related to bounds of energies. Samir et al. [25] constructed 1-splitting and 1-shadow graph of any simple connected graph and proved that adjacency energies of these newly constructed graphs is constant multiple of the energies of the original graph. Samir et al. [26] then generalized the idea of 1-splitting and 2-shadow graph to arbitrary s-splitting and s-shadow graph where s>0 and obtained similar kind of general results for adjacency energies. Liu et al. [27] discussed distance and adjacency energies of multi-level wheel networks. Chu et al. [19] computed Laplacian and signless Laplacian spectra and energies of multi-step wheels.
In 2015, Liu et al. [29] discussed asymptotic Laplacian energy like invariants of lattices. In 2016, Hosamani et al. [30] presented degree sum energy of a graph and obtained some lower bounds for this energy. In 2018, Basavanagoud et al. [31] computed the characteristic polynomial of the degree square sum matrix of graphs obtained by some graph operations as well as some bounds for spectral radius for square sum eigenvalue and degree square sum energy of graphs. In 2018, Rad et al. [32] presented Zagreb energy and related Estrada index of various graphs. In 2019, Gutman et al. [33] discussed graph energy and its applications, featuring about hundred kinds of graph energies and applications in diverse areas. For further details and basic ideas of graph energies, we refer [20,21,34,35,36]. Interconnection and various applications of graph energy in chemistry of unsaturated hydrocarbons can be traced in [37,38,39]. Applications of different graph energies in crystallography can be found in [40,41], theory of macro molecules in [42,43], protein sequences in [44,45,46], biology in [47], applied network analysis in [47,48,49,50,51,52], problems of air transportation in [48], satellite communications in [50] and constructions of spacecrafts in [52].
In the present article we produce new results about maximum degree spectral radii and minimum degree spectral radii of m-splitting and m-shadow graphs. In fact we relate these spectral radii of new graph operations with spectral radii of original graphs. The article is organized as follows. Section 2 gives basic definitions and terminologies to lay foundations of our results. In Section 3, we derive maximum degree spectral radii and minimum degree spectral radii of generalized splitting graph constructed on any basic graph. In Section 4 we proceed to find similar results but for generalized shadow graph of the given regular graph.
In this part we outline main ideas and preliminary facts, for details see [53,54]. The matrix M(G) is the maximum degree matrix of the graph G defined in [53] as
M(G)={max(di,dj),ifviandvjareadjacent,0,elsewhere.} |
Here di and dj are the degrees of vertices vi and vj respectively. Eigenvalues of maximum degree matrix of the graph G are denoted as η1,η2,⋯ηn. Maximum degree spectral radius is defined as
℘M(G)=nmaxi=1|ηi|, |
where η1,η2,...,ηn are the eigenvalues of maximum degree matrix. The matrix MI(G) is called the minimum degree matrix of the graph G is defined in [54] as
MI(G)={min(di,dj),ifviandvjareadjacent,0,elsewhere.} |
Minimum degree spectral radius is defined as
℘MI(G)=nmaxi=1|ηi|, |
where η1,η2,...,ηn are the eigenvalues of minimum degree matrix. If we add a new vertex v′ to each vertex v of the graph G, v′ is connected to every vertex that is adjacent to v in G then we obtain the splitting graph (spl1(G)). Take two copies G′ and G″ of the graph G, then (sh2(G)) is constructed if we join each vertex in G′ to the neighbors of the corresponding vertices in G″. Let UϵRm×n, VϵRp×q the tensor product (Kronecker product), U⨂V is defined as the matrix.
U⨂V=(a11V...a1nV............an1V...annV) |
Proposition 1.1. Let UϵMm, VϵMn and α be an eigenvalue of U and η be an eigenvalue of V, then αη is an eigenvalue of U⨂V [25]. Now we move towards the main results.
In this part we relate maximum degree spectral radius and minimum degree spectral radius of generalized splitting graph with original graph G. Here again we emphasis that G is any regular graph.
Theorem 1. Let G be any n-regular graph and ℘M(Splm(G)) is themaximum degree spectral radius of m-splitting graph G, then
℘M(Splm(G))=℘M(G)((m+1)(1+√1+4m)2). |
Proof. Maximum degree matrix is given by M(G) where
M(G)={max(di,dj),ifviandvjareadjacent,0,elsewhere.} |
M(Splm(G)) can be written in block matrix form as
M(Splm(G))={(m+1)Mifi=1,j≥1andj=1,i≥1,0elsewhere.} |
=M⨂{(m+1)ifi=1,j≥1andj=1,i≥1,0elsewhere.} |
Let
A={(m+1)ifi=1,j≥1andj=1,i≥1,0elsewhere.}m+1 |
Now we compute the eigenvalues of A Since matrix A is of rank two, so A has two non-zero eigenvalues, say α1 and α2. Obviously,
α1+α2=tr(A)=m+1. | (3.1) |
Considering
A2={(m+1)3ifi=1andj=1,(m+1)2elsewhere.}m+1 |
Then
α21+α22=tr(A2)=(m+1)3+m((m+1)2). | (3.2) |
Solving Eqs (3.1) and (3.2), we have
α1=(m+1)(1+√1+4m)2. |
and
α2=(m+1)(1−√1+4m)2. |
So we have,
specA=(0(m+1)(1+√1+4m)2(m+1)(1−√1+4m)2m−111) | (3.3) |
Using Eq (3.3) we have
specA=(0(m+1)(1+√1+4m)2(m+1)(1−√1+4m)2m−111). |
Since M(Splm(G))=M(G)⨂A then by Proposition 1.1, we have
℘M(Splm(G))=Maxni=1|(specA))ηi| |
℘M(Splm(G))=Maxni=1|ηi|[(m+1)(1+√1+4m)2] |
℘M(Splm(G))=℘M(G)((m+1)(1+√1+4m)2). |
In the following corollaries, we obtain the maximum degree spectral radii of splitting graphs of Cn, Kn, Cn,n and crown graph.
Corollary 2. If n≥3 and G is a Cn graph, where Cn is cycle graph on n vertices, then
℘M(Splm(Cn))=4((m+1)(1+√1+4m)2). |
Proof. If G is a cycle graph Cn(n≥3), then ℘M(Cn)=4. Since cycle graph is 2-regular graph so using Theorem 1 we get the required result.
Corollary 3. If G is a Kn graph, where Kn is complete graph on n vertices, then
℘M(Splm(Kn))=(n−1)2((m+1)(1+√1+4m)2). |
Proof. If G is a complete graph on n vertices, then ℘M(Kn)=(n−1)2. Since complete graph is n−1-regular graph so using Theorem 1 we get the required result.
Corollary 4. If G is a complete bipartite graph Kn,n, then
℘M(Splm(Kn,n))=(n)2((m+1)(1+√1+4m)2). |
Proof. If G is a complete bipartite graph Kn,n, then ℘M(Kn,n)=(n)2. Using Theorem 1 we get the required result.
Corollary 5. If G is a crown graph on 2n vertices, then
℘M(Splm(G))=(n−1)2((m+1)(1+√1+4m)2). |
Proof. If G is a crown graph on 2n vertices, then ℘M(G)=(n−1)2. Using Theorem 1 we get the required result.
Theorem 6. Let G be any n-regular graph and ℘MI((Splm(G)) is theminimum degree spectral radius of m-splitting graph G, then
℘MI(Splm(G))=℘MI(G)(m+1+√m2+6m+12). |
Proof. Minimum degree matrix is given by
MI(G)={min(di,dj),ifviandvjareadjacent,0,elsewhere.} |
MI(Splm(G)) can be written in block matrix form as follows:
MI(Splm(G))={(m+1)MIifi=1andj=1MIifi=1,j≥2andj=1,i≥2,0elsewhere.} |
=MI⨂{(m+1)ifi=1andj=11ifi=1,j≥2andj=1,i≥2,0elsewhere.} |
Let
A={(m+1)ifi=1andj=11ifi=1,j≥2andj=1,i≥2,0elsewhere.}m+1 |
Now we compute the eigenvalues of A Since matrix A is of rank two, so A has two non-zero eigenvalues, say α1 and α2. Obviously,
α1+α2=tr(A)=m+1. | (3.4) |
Considering
A2={(m+1)2+mifi=1andj=1,m+1ifi=1,j≥2andj=1,i≥2,1elsewhere.}m+1 |
Then
α21+α22=tr(A2)=(m+1)2+2m. | (3.5) |
Solving Eqs (3.4) and (3.5) we have
α1=m+1+√m2+6m+12. |
α2=m+1−√m2+6m+12. |
So we have,
specA=(0m+1+√m2+6m+12m+1−√m2+6m+12.m−111) | (3.6) |
Using Eq (3.6) we have
specA=(0m+1+√m2+6m+12m+1−√m2+6m+12.m−111). |
Since MI(Splm(G))=MI(G)⨂A then by Proposition 1.1, we have
℘MI(Splm(G))=Maxni=1|(specA))ηi| |
℘MI(Splm(G))=Maxni=1|ηi|[m+1+√m2+6m+12] |
℘MI(Splm(G))=℘MI(G)(m+1+√m2+6m+12). |
In the following corollaries, we obtain the minimum degree spectral radii of splitting graphs of Cn, Kn, Cn,n and crown graph.
Corollary 7. If n≥3 and G is a Cn graph, where Cn is cycle graph on n vertices, then
℘MI(Splm(Cn))=4(m+1+√m2+6m+12). |
Proof. If G is a cycle graph Cn(n≥3), then ℘MI(Cn)=4. Since cycle graph is 2-regular graph so using Theorem 6 we get the required result.
Corollary 8. If G is a Kn graph, where Kn is complete graph on n vertices, then
℘MI(Splm(Kn))=(n−1)2(m+1+√m2+6m+12). |
Proof. If G is a complete graph on n vertices, then ℘MI(Kn)=(n−1)2. Since complete graph is n−1-regular graph so using Theorem 6 we get the required result.
Corollary 9. If G is a complete bipartite graph Kn,n, then
℘MI(Splm(Kn,n))=(n)2(m+1+√m2+6m+12). |
Proof. If G is a complete bipartite graph Kn,n, then ℘MI(Kn,n)=(n)2. Using Theorem 6 we get the required result.
Corollary 10. If G is a crown graph on 2n vertices, then
℘MI(Splm(G))=(n−1)2(m+1+√m2+6m+12). |
Proof. If G is a crown graph on 2n vertices, then ℘MI(G)=(n−1)2. Using Theorem 6 we get the required result.
In this part we relate maximum degree spectral radius and minimum degree spectral radius of generalized Shadow graph with original graph G. Here again we emphasis that G is any regular graph.
Theorem 11. Let G be any n-regular graph and ℘M(Shm(G)) is themaximum degree spectral radius of m-shadow graph G, then
℘M(Shm(G))=℘M(G)((m)2). |
Proof. Maximum degree matrix is given by
M(G)={max(di,dj),ifviandvjareadjacent,0,elsewhere.} |
Then M(Shm(G)) can be written in block matrix form as follows:
M(Shm(G))={(m)M∀iandj.} |
=M⨂{m∀iandj.} |
Let
A={m∀iandj.}m |
Now we compute the eigenvalues of A Since matrix A is of rank one, so A has one non-zero eigenvalue, say α1=(m)2. So we have,
specA=(0(m)2m−11) | (4.1) |
Using Eq (4.1) we have
specA=(0(m)2m−11). |
Since M(Shm(G))=M(G)⨂A then by Proposition 1.1, we have
℘M(Shm(G))=Maxni=1|(specA))ηi| |
℘M(Shm(G))=Maxni=1|ηi|[(m)2] |
℘M(Shm(G))=℘M(G)((m)2). |
In the following corollaries, we obtain the maximum degree spectral radii of shadow graphs of Cn, Kn, Cn,n and crown graph.
Corollary 12. If n≥3 and G is a Cn graph, where Cn is cycle graph on n vertices, then
℘M(Shm(Cn))=4((m)2). |
Proof. If G is a cycle graph Cn(n≥3), then ℘M(Cn)=4. Since cycle graph is 2-regular graph so using Theorem 11 we get the required result.
Corollary 13. If G is a Kn graph, where Kn is complete graph on n vertices, then
℘M(Shm(Kn))=(n−1)2((m)2). |
Proof. If G is a complete graph on n vertices, then ℘M(Kn)=(n−1)2. Since complete graph is n−1-regular graph so using Theorem 11, we get the required result.
Corollary 14. If G is a complete bipartite graph Kn,n, then
℘M(Shm(Kn,n))=(n)2((m)2). |
Proof. If G is a complete bipartite graph Kn,n, then ℘M(Kn,n)=(n)2. Using Theorem 11, we get the required result.
Corollary 15. If G is a crown graph on 2n vertices, then
℘M(Shm(G))=(n−1)2((m)2). |
Proof. If G is a crown graph on 2n vertices, then ℘M(G)=(n−1)2. Using Theorem 11, we get the required result.
Theorem 16. Let G be any n-regular graph and ℘MI(Shm(G)) is theminimum degree spectral radius of m-shadow graph G, then
℘MI(Shm(G))=(m)2℘MI(G). |
Proof. Minimum degree matrix is given by
MI={min(di,dj),ifviandvjareadjacent,0,elsewhere.} |
Then MI(Shm(G)) can be written in block matrix form as follows:
MI(Shm(G))={(m)MI∀iandj.} |
=MI⨂{m∀iandj.} |
Let
A={m∀iandj.}m |
Now we compute the eigenvalues of A Since matrix A is of rank one, so A has one non-zero eigenvalue, say α1=(m)2. So we have,
specA=(0(m)2m−11) | (4.2) |
Using Eq (4.2) we have
specA=(0(m)2m−11). |
Since MI(Shm(G))=MI(G)⨂A then by Proposition 1.1, we have
℘MI(Shm(G))=Maxni=1|(specA))ηi| |
℘MI(Shm(G))=Maxni=1|ηi|[(m)2] |
℘MI(Shm(G))=℘MI(G)((m)2). |
In the following corollaries, we obtain the minimum degree spectral radii of shadow graphs of Cn, Kn, Cn,n and crown graph.
Corollary 17. If n≥3 and G is a Cn graph, where Cn is cycle graph on n vertices, then
℘MI(Shm(Cn))=4((m)2). |
Proof. If G is a cycle graph Cn(n≥3), then ℘MI(Cn)=4. Since cycle graph is 2-regular graph so using Theorem 16 we get the required result.
Corollary 18. If G is a Kn graph, where Kn is complete graph on n vertices, then
℘MI(Shm(Kn))=(n−1)2((m)2). |
Proof. If G is a complete graph on n vertices, then ℘MI(Kn)=(n−1)2. Since complete graph is n−1-regular graph so using Theorem 16 we get the required result.
Corollary 19. If G is a complete bipartite graph Kn,n, then
℘MI(Shm(Kn,n))=(n)2((m)2). |
Proof. If G is a complete bipartite graph Kn,n, then ℘MI(Kn,n)=(n)2. Using Theorem 16, we get the required result.
Corollary 20. If G is a crown graph on 2n vertices, then
℘MI(Shm(G))=(n−1)2((m)2). |
Proof. If G is a crown graph on 2n vertices, then ℘MI(G)=(n−1)2. Using Theorem 16 we get the required result.
The spectral radius of graph has vast range of applications in computer related areas. It also connects graph theory and chemistry. In this article we have related the spectral radii of the generalized shadow and splitting graph of any regular graph with spectral radius of the given graph. In particular we have proved that the Spectral Radius of the new graph is a multiple of spectral radius of the given regular graph.
The authors thank the National Key Research and Development Program under Grant 2018YFB0904205, Science and Technology Bureau of ChengDu (2020-YF09-00005-SN), Sichuan Science and Technology program (2021YFH0107) and Erasmus + SHYFTE Project (598649-EPP-1-2018-1-FR-EPPKA2-CBHE-JP).
The authors declare that there is no conflict of interest.
[1] |
J. L. Zhou, S. Q. Zhang, Y. B. He, Existence and stability of solution for nonlinear differential equations with ψ-Hilfer fractional derivative, Appl. Math. Lett., 121 (2021), 107457. https://doi.org/10.1016/j.aml.2021.107457 doi: 10.1016/j.aml.2021.107457
![]() |
[2] |
J. Li, X. N. Su, K. Y. Zhao, Barycentric interpolation collocation algorithm to solve fractional differential equations, Math. Comput. Simul., 205 (2023), 340–367. https://doi.org/10.1016/j.matcom.2022.10.005 doi: 10.1016/j.matcom.2022.10.005
![]() |
[3] |
T. T. Xue, W. B. Liu, T. F. Shen, Extremal solutions for p-Laplacian boundary value problems with the right-handed Riemann-Liouville fractional derivative, Math. Methods Appl. Sci., 42 (2019), 4394–4407. https://doi.org/10.1002/mma.5660 doi: 10.1002/mma.5660
![]() |
[4] |
J. L. Zhou, S. Q. Zhang, Y. B. He, Existence and stability of solution for a nonlinear fractional differential equation, J. Math. Anal. Appl., 498 (2021), 124921. https://doi.org/10.1016/j.jmaa.2020.124921 doi: 10.1016/j.jmaa.2020.124921
![]() |
[5] |
C. L. Tian, T. Jin, X. F. Yang, Q. Y. Liu, Reliability analysis of the uncertain heat conduction model, Comput. Math. Appl., 119 (2022), 131–140. https://doi.org/10.1016/J.CAMWA.2022.05.033 doi: 10.1016/J.CAMWA.2022.05.033
![]() |
[6] |
T. T. Xue, X. L. Fan, J. Zhu, A class of deterministic and stochastic fractional epidemic models with vaccination, Comput. Math. Methods Med., 1797258 (2022), 1–22. https://doi.org/10.1155/2022/1797258 doi: 10.1155/2022/1797258
![]() |
[7] |
T. Jin, X. F. Yang, Monotonicity theorem for the uncertain fractional differential equation and application to uncertain financial market, Math. Comput. Simul., 190 (2021), 203–221. https://doi.org/10.1016/J.MATCOM.2021.05.018 doi: 10.1016/J.MATCOM.2021.05.018
![]() |
[8] | T. Jin, X. F. Yang, H. X. Xia, D. Hui, Reliability index and option pricing formulas of the first-hitting time model based on the uncertain fractional-order differential equation with Caputo type, Fractals, 29 (2021). https://doi.org/10.1142/S0218348X21500122 |
[9] |
D. A. Benson, S. W. Wheatcraft, M. M. Meerschaert, Application of a fractional advection-dispersion equation, Water Resour. Res., 36 (2000), 1403–1412. https://doi.org/10.1029/2000WR900031 doi: 10.1029/2000WR900031
![]() |
[10] |
D. A. Benson, S. W. Wheatcraft, M. M. Meerschaert, The fractional-order governing equation of levy motion, Water Resour. Res., 36 (2000), 1413–1423. https://doi.org/10.1029/2000WR900032 doi: 10.1029/2000WR900032
![]() |
[11] |
V. J. Ervin, J. P. Roop, Variational formulation for the stationary fractional advection dispersion equation, Numer. Methods Partial Differ. Equations, 22 (2006), 558–576. https://doi.org/10.1002/num.20112 doi: 10.1002/num.20112
![]() |
[12] |
F. Jiao, Y. Zhou, Existence of solutions for a class of fractional boundary value problems via critical point theory, Comput. Math. Appl., 62 (2011), 1181–1199. https://doi.org/10.1016/j.camwa.2011.03.086 doi: 10.1016/j.camwa.2011.03.086
![]() |
[13] |
F. Jiao, Y. Zhou, Existence results for fractional boundary value problem via critical point theory, Int. J. Bifurcation Chaos, 22 (2012), 1–17. https://doi.org/10.1142/S0218127412500861 doi: 10.1142/S0218127412500861
![]() |
[14] |
G. Bonanno, R. Rodríguez-López, S. Tersian, Existence of solutions to boundary value problem for impulsive fractional differential equations, Fract. Calc. Appl. Anal., 17 (2014), 717–744. https://doi.org/10.2478/s13540-014-0196-y doi: 10.2478/s13540-014-0196-y
![]() |
[15] |
R. Rodríguez-López, S. Tersian, Multiple solutions to boundary value problem for impulsive fractional differential equations, Fract. Calc. Appl. Anal., 17 (2014), 1016–1038. https://doi.org/10.2478/s13540-014-0212-2 doi: 10.2478/s13540-014-0212-2
![]() |
[16] |
C. E. T. Ledesma, N. Nyamoradi, Impulsive fractional boundary value problem with pLaplace operator, J. Appl. Math. Comput., 55 (2017), 257–278. https://doi.org/10.1007/s12190-016-1035-6 doi: 10.1007/s12190-016-1035-6
![]() |
[17] |
I. Bogun, Existence of weak solutions for impulsive p-Laplacian problem with superlinear impulses, Nonlinear Anal. Real World Appl., 13 (2012), 2701–2707. https://doi.org/10.1016/j.nonrwa.2012.03.014 doi: 10.1016/j.nonrwa.2012.03.014
![]() |
[18] |
J. F. Xu, Z. L. Wei, Y. Z. Ding, Existence of weak solutions for p-Laplacian problem with impulsive effects, Taiwanese J. Math., 17 (2013), 501–515. https://doi.org/10.11650/tjm.17.2013.2081 doi: 10.11650/tjm.17.2013.2081
![]() |
[19] | A. A. Kilbas, H. M. Srivastava, J. J. Trujillo, Theory and Applications of Fractional Differential Equations, Chichester: Elsevier, Amsterdam, 2006. |
[20] |
D. Idczak, S. Walczak, Fractional Sobolev spaces via Riemann-Liouville derivatives, J. Funct. Spaces, 2013 (2013), 1–15. https://doi.org/10.1155/2013/128043 doi: 10.1155/2013/128043
![]() |
[21] | P. H. Rabinowitz, Minimax Methods in Critical Point Theory with Applications to Differential Equations, CBMS Regional Conference Series in Mathematics, 65 (1986). |
[22] |
G. Bonanno G, S. A. Marano, On the structure of the critical set of non-differentiable functions with a weak compactness condition, Appl. Anal., 89 (2010), 1–10. https://doi.org/10.1080/00036810903397438 doi: 10.1080/00036810903397438
![]() |
[23] |
J. Simon, Régularité de la solution d'un problème aux limites non linéaires, Ann. Fac. Sci. Toulouse, 3 (1981), 247–274. https://doi.org/10.5802/AFST.569 doi: 10.5802/AFST.569
![]() |
[24] | E. Zeidler, Nonlinear functional analysis and its applications, Springer New York, NY, 1990. https://doi.org/10.1007/978-1-4612-0981-2 |
1. | Ahmad Bilal, Mobeen Munir, Randic and reciprocal randic spectral radii and energies of some graph operations, 2022, 10641246, 1, 10.3233/JIFS-221938 | |
2. | Ahmad Bilal, Muhammad Mobeen Munir, ABC energies and spectral radii of some graph operations, 2022, 10, 2296-424X, 10.3389/fphy.2022.1053038 | |
3. | Ahmad Bilal, Muhammad Mobeen Munir, Muhammad Imran Qureshi, Muhammad Athar, ISI spectral radii and ISI energies of graph operations, 2023, 11, 2296-424X, 10.3389/fphy.2023.1149006 | |
4. | Linlin Wang, Sujuan Liu, Han Jiang, Rainbow connections of bioriented graphs, 2024, 10, 24058440, e31426, 10.1016/j.heliyon.2024.e31426 | |
5. | A. R. Nagalakshmi, A. S. Shrikanth, G. K. Kalavathi, K. S. Sreekeshava, The Degree Energy of a Graph, 2024, 12, 2227-7390, 2699, 10.3390/math12172699 | |
6. | Muhammad Mobeen Munir, Urwah Tul Wusqa, Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation, 2023, 11, 2296-2646, 10.3389/fchem.2023.1267291 | |
7. | Caicai Feng, Muhammad Farhan Hanif, Muhammad Kamran Siddiqui, Mazhar Hussain, Nazir Hussain, On analysis of entropy measure via logarithmic regression model for 2D-honeycomb networks, 2023, 138, 2190-5444, 10.1140/epjp/s13360-023-04547-4 | |
8. | Ahmad Bilal, Muhammad Mobeen Munir, SDD Spectral Radii and SDD Energies of Graph Operations, 2024, 1007, 03043975, 114651, 10.1016/j.tcs.2024.114651 | |
9. | Xueliang Li, Ruiling Zheng, Extremal results on the spectral radius of function-weighted adjacency matrices, 2025, 373, 0166218X, 204, 10.1016/j.dam.2025.04.060 |