Citation: Kenneth R. Paap, Hunter Myuz, Regina Anders-Jefferson, Lauren Mason, Brandon Zimiga. On the ambiguity regarding the relationship between sequential congruency effects, bilingual advantages in cognitive control, and the disengagement of attention[J]. AIMS Neuroscience, 2019, 6(4): 282-298. doi: 10.3934/Neuroscience.2019.4.282
| [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 $ {{\mathcal{S}}({\Gamma})} $. 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 |
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 $ \wp(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\geq3 $, 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 $ d_{i} $ and $ d_{j} $ are the degrees of vertices $ v_{i} $ and $ v_{j} $ respectively. Eigenvalues of maximum degree matrix of the graph $ G $ are denoted as $ \eta_{1}, \eta_{2}, \cdots \eta_{n} $. Maximum degree spectral radius is defined as
|
$ ℘M(G)=nmaxi=1|ηi|, $
|
where $ \eta_1, \eta_2, ..., \eta_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 $ \eta_1, \eta_2, ..., \eta_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 $ (spl_{1}(G)) $. Take two copies $ G' $ and $ G'' $ of the graph $ G $, then $ (sh_{2}(G)) $ is constructed if we join each vertex in $ G' $ to the neighbors of the corresponding vertices in $ G'' $. Let $ U\epsilon R^{m\times n} $, $ V \epsilon R^{p\times q} $ the tensor product (Kronecker product), $ U\bigotimes V $ is defined as the matrix.
|
$ U⨂V=(a11V...a1nV............an1V...annV) $
|
Proposition 1.1. Let $ U \epsilon M^{m} $, $ V\epsilon M^{n} $ and $ \alpha $ be an eigenvalue of $ U $ and $ \eta $ be an eigenvalue of $ V $, then $ \alpha\eta $ is an eigenvalue of $ U \bigotimes 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 $ \wp M(Spl_{m}(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(Spl_{m}(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 $ \alpha_{1} $ and $ \alpha_{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 (Spl_{m}(G)) = M(G) \bigotimes 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 $ C_{n} $, $ K_{n} $, $ C_{n, n} $ and crown graph.
Corollary 2. If $ n\geq3 $ and $ G $ is a $ C_{n} $ graph, where $ C_{n} $ is cycle graph on $ n $ vertices, then
|
$ ℘M(Splm(Cn))=4((m+1)(1+√1+4m)2). $
|
Proof. If $ G $ is a cycle graph $ C_{n} (n\geq3) $, then $ \wp M(C_{n}) = 4 $. Since cycle graph is 2-regular graph so using Theorem 1 we get the required result.
Corollary 3. If $ G $ is a $ K_{n} $ graph, where $ K_{n} $ 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 $ \wp M(K_{n}) = (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 $ K_{n, n} $, then
|
$ ℘M(Splm(Kn,n))=(n)2((m+1)(1+√1+4m)2). $
|
Proof. If $ G $ is a complete bipartite graph $ K_{n, n} $, then $ \wp M(K_{n, 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 $ \wp M(G) = (n-1)^{2} $. Using Theorem 1 we get the required result.
Theorem 6. Let $ G $ be any $ n $-regular graph and $ \wp MI((Spl_{m}(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(Spl_{m}(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 $ \alpha_{1} $ and $ \alpha_{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(Spl_{m}(G)) = MI(G) \bigotimes 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 $ C_{n} $, $ K_{n} $, $ C_{n, n} $ and crown graph.
Corollary 7. If $ n\geq3 $ and $ G $ is a $ C_{n} $ graph, where $ C_{n} $ is cycle graph on $ n $ vertices, then
|
$ ℘MI(Splm(Cn))=4(m+1+√m2+6m+12). $
|
Proof. If $ G $ is a cycle graph $ C_{n} (n\geq3) $, then $ \wp MI(C_{n}) = 4 $. Since cycle graph is 2-regular graph so using Theorem 6 we get the required result.
Corollary 8. If $ G $ is a $ K_{n} $ graph, where $ K_{n} $ 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 $ \wp MI(K_{n}) = (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 $ K_{n, n} $, then
|
$ ℘MI(Splm(Kn,n))=(n)2(m+1+√m2+6m+12). $
|
Proof. If $ G $ is a complete bipartite graph $ K_{n, n} $, then $ \wp MI(K_{n, 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 $ \wp 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 $ \wp M(Sh_{m}(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(Sh_{m}(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 $ \alpha_{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(Sh_{m}(G)) = M(G) \bigotimes 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 $ C_{n} $, $ K_{n} $, $ C_{n, n} $ and crown graph.
Corollary 12. If $ n\geq3 $ and $ G $ is a $ C_{n} $ graph, where $ C_{n} $ is cycle graph on $ n $ vertices, then
|
$ ℘M(Shm(Cn))=4((m)2). $
|
Proof. If $ G $ is a cycle graph $ C_{n} (n\geq3) $, then $ \wp M(C_{n}) = 4 $. Since cycle graph is 2-regular graph so using Theorem 11 we get the required result.
Corollary 13. If $ G $ is a $ K_{n} $ graph, where $ K_{n} $ 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 $ \wp M(K_{n}) = (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 $ K_{n, n} $, then
|
$ ℘M(Shm(Kn,n))=(n)2((m)2). $
|
Proof. If $ G $ is a complete bipartite graph $ K_{n, n} $, then $ \wp M(K_{n, 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 $ \wp M(G) = (n-1)^{2} $. Using Theorem 11, we get the required result.
Theorem 16. Let $ G $ be any $ n $-regular graph and $ \wp MI(Sh_{m}(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(Sh_{m}(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 $ \alpha_{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(Sh_{m}(G)) = MI(G) \bigotimes 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 $ C_{n} $, $ K_{n} $, $ C_{n, n} $ and crown graph.
Corollary 17. If $ n\geq3 $ and $ G $ is a $ C_{n} $ graph, where $ C_{n} $ is cycle graph on $ n $ vertices, then
|
$ ℘MI(Shm(Cn))=4((m)2). $
|
Proof. If $ G $ is a cycle graph $ C_{n} (n\geq3) $, then $ \wp MI(C_{n}) = 4 $. Since cycle graph is 2-regular graph so using Theorem 16 we get the required result.
Corollary 18. If $ G $ is a $ K_{n} $ graph, where $ K_{n} $ 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 $ \wp MI(K_{n}) = (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 $ K_{n, n} $, then
|
$ ℘MI(Shm(Kn,n))=(n)2((m)2). $
|
Proof. If $ G $ is a complete bipartite graph $ K_{n, n} $, then $ \wp MI(K_{n, 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 $ \wp 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] |
Goldsmith SF, Morton JB (2018) Time to disengage from the bilingual advantage hypothesis. Cognition 170: 328–329. doi: 10.1016/j.cognition.2017.09.011
|
| [2] |
Bialystok E (2017) The bilingual adaptation: How minds accommodate experience. Psychol Bull 143: 233–262. doi: 10.1037/bul0000099
|
| [3] |
Grundy JG, Chung-Fat-Yim A, Friesen DC, et al. (2017) Sequential congruency effects reveal differences in disengagement of attention for monolingual and bilingual young adults. Cognition 163: 42–55. doi: 10.1016/j.cognition.2017.02.010
|
| [4] | Goldsmith SF, Morton JB (2018). Sequential congruency effects in monolingual and bilingual adults: A failure to replicate Grundy et al. (2017). Front Psychol 9: 2476. |
| [5] | Paap KR (2019) The bilingual advantage debate: Quantity and quality of the evidence, In: Schwieter JW (Ed.), The Handbook of Neuroscience of Multilingualism, London: Wiley-Blackwell, 701–735. |
| [6] |
Paap KR, Anders-Jefferson R, Mason L, et al. (2018) Bilingual advantages in inhibition or attentional control: More challenges. Front Psychol 9: 1409. doi: 10.3389/fpsyg.2018.01409
|
| [7] |
Bialystok E, Grundy JG (2018) Science does not disengage. Cognition 170: 330–333. doi: 10.1016/j.cognition.2017.10.019
|
| [8] | Grundy JG, Bialystok E (2019) When a "replication" is not a replication. Commentary: sequential congruency effects in monolingual and bilingual adults. Front Psychol 10: 797. |
| [9] |
Paap KR, Greenberg ZI (2013) There is no coherent evidence for a bilingual advantage in executive processing. Cogn Psychol 66: 232–258. doi: 10.1016/j.cogpsych.2012.12.002
|
| [10] |
Lehtonen M, Soveri A, Laine A, et al. (2018) Is bilingualism associated with enhanced executive functioning in adults? A meta-analytic review. Psychol Bull 144: 394–425. doi: 10.1037/bul0000142
|
| [11] | Donnelly S, Brooks PJ, Homer BD (2019) Is there a bilingual advantage on interference-control tasks? A multiverse-analysis of global reaction time and interference cost. Psychon Bull Rev 26: 1122–1147. |
| [12] |
Weissman DH, Egner T, Hawks Z, et al. (2015) The congruency sequence effect emerges when the distracter precedes the target. Acta Psychol 156: 8–21. doi: 10.1016/j.actpsy.2015.01.003
|
| [13] |
Mayr U, Awh E (2009) The elusive link between conflict and conflict adaptation. Psychol Res 73: 794–802. doi: 10.1007/s00426-008-0191-1
|
| [14] |
Gilbert SJ, Shallice T (2002) Task switching: a PDP model. Cogn Psychol 44: 297–337. doi: 10.1006/cogp.2001.0770
|
| [15] |
Costa A, Hernández M, Sebastián-Gallés N (2008) Bilingualism aids conflict resolution: Evidence from the ANT task. Cognition 106: 59–86. doi: 10.1016/j.cognition.2006.12.013
|
| [16] | Guido Mendes C (2015) The impact of bilingualism on conflict control. Doctoral dissertation, University of Otago, Dunedin, New Zealand. |
| [17] |
Costa A, Hernández M, Costa‐Faidella J, et al. (2009) On the bilingual advantage in conflict processing: now you see it, now you don't. Cognition 113: 135–149. doi: 10.1016/j.cognition.2009.08.001
|
| [18] |
Bialystok E, Craik FI, Klein R, et al. (2004) Bilingualism, aging, and cognitive control: evidence from the Simon task. Psychol Aging 19: 290–303. doi: 10.1037/0882-7974.19.2.290
|
| [19] | Paap KR, Sawi O (2014) Bilingual advantages in executive functioning: Problems in convergent validity, divergent validity, and the identification of the theoretical constructs. Front Psychol 5: 962. |
| [20] |
Marian V, Blumenfeld HK, Kaushanskaya M (2007) The Language Experience and Proficiency Questionnaire (LEAP-Q): assessing language profiles in bilinguals and multilinguals. J Speech Lang Hear Res 50: 940–967. doi: 10.1044/1092-4388(2007/067)
|
| [21] | Francis WS, Strobach EN (2013, November) Prediction of objective bilingual language proficiency: Can self-report measures suffice? Paper presented at the 54th Annual Meeting of the Psychonomic Society. Toronto, Canada. |
| [22] | Egner T, Ely S, Grinband J (2010) Going, going, gone: Characterizing the time-course of congruency sequence effects. Front Psychol 1: 154. |
| [23] |
Braver TS (2012) The variable nature of cognitive control: a dual mechanisms framework. Trends Cogn Sci 16: 106–113. doi: 10.1016/j.tics.2011.12.010
|
| [24] |
De Pisapia N, Braver TS (2006) A model of dual control mechanisms through anterior cingulate and prefrontal cortex interactions. Neurocomputing 69: 1322–1326. doi: 10.1016/j.neucom.2005.12.100
|
| [25] | Grundy JG, Bialystok E (2015) It's not that simple: Sequential congruency effects reveal a bilingual disengagement advantage. Poster session presented at the Workshop on Bilingualism and Executive Function: An Interdisciplinary Approach, CUNY Graduate Center, NY. |
| [26] |
Egner T (2008) Multiple conflict-driven control mechanisms in the human brain. Trends Cogn Sci 12: 374–380. doi: 10.1016/j.tics.2008.07.001
|
| [27] | Whitehead PS, Brewer GA, Blais C (2018) Are cognitive control processes reliable? J Exp Psychol Learn 45: 765–778. |
| [28] |
Prior A, MacWhinney B (2010) A bilingual advantage in task switching. Biling Lang Cogn 13: 253–262. doi: 10.1017/S1366728909990526
|
| [29] |
Prior A, Gollan TH (2011) Good language‐switchers are good task‐switchers: Evidence from Spanish–English and Mandarin–English bilinguals. J Int Neuropsychol Soc 17: 682–691. doi: 10.1017/S1355617711000580
|
| [30] | Cattaneo G, Costa A, Gironell A, et al. (2019) On the specificity of bilingual language control: A study with Parkinson's disease patients. Biling Lang Cogn: 1–9. |
| [31] |
Dell GS, Burger LK, Svec WR (1997) Language production and serial order: a functional analysis and a model. Psychol Rev 104: 123–147. doi: 10.1037/0033-295X.104.1.123
|
| [32] |
Sevald CA, Dell GS (1994) The sequential cuing effect in speech production. Cognition 53: 91–127. doi: 10.1016/0010-0277(94)90067-1
|
| [33] |
Rosenbaum DA, Weber RJ, Hazelett WH, et al. (1986) The parameter remapping effect in human performance: Evidence from tongue twisters and finger fumblers. J Mem Lang 25: 710–725. doi: 10.1016/0749-596X(86)90045-8
|
| [34] |
Friesen DC, Latman V, Calvo A, et al. (2015) Attention during visual search: the benefit of bilingualism. Int J Biling 19: 693–702. doi: 10.1177/1367006914534331
|
| [35] |
Ratiu I, Hout MC, Walenchok SC, et al. (2017) Comparing visual search and eye movements in bilinguals and monolinguals. Atten Percept Psychophys 79: 1695–1725. doi: 10.3758/s13414-017-1328-3
|
| [36] | Mason LA, Zimiga BM, Anders-Jefferson R, et al. (2019) On the relationships between autistic traits, executive functioning, self-control and exercise. Poster session presented at the 26th annual meeting of the Cognitive Neuroscience Society, San Francisco, CA. |
| [37] |
Chun-Fat-Yim A, Sorge GB, Bialystok E (2017) The relationship between bilingualism and selective attention in young adults: Evidence from an ambiguous figures task. Q J Exp Psychol 70: 366–372. doi: 10.1080/17470218.2016.1221435
|
| [38] |
Mishra RK, Hilchey MD, Singh N, et al. (2012) On the time course of exogeneous cuing effects in bilinguals: higher proficiency in a second language is associated with more rapid endogenous disengagement. Q J Exp Psychol 65: 1502–1510. doi: 10.1080/17470218.2012.657656
|
| [39] |
Hernández M, Costa A, Fuentes LJ, et al. (2010) The impact of bilingualism on the executive control and orienting networks of attention. Biling Lang Cogn 13: 315–325. doi: 10.1017/S1366728909990010
|
| [40] |
Saint-Aubin J, Hilchey MD, Mishra R, et al. (2018) Does the relation between the control of attention and second language proficiency generalize from India to Canada? Can J Exp Psychol 72: 208–218. doi: 10.1037/cep0000151
|
| [41] |
Blumenfeld HK, Marian V (2011) Bilingualism influences inhibitory control in auditory comprehension. Cognition 118: 245–257. doi: 10.1016/j.cognition.2010.10.012
|
| [42] |
Paap KR, Liu Y (2014) Conflict resolution in sentence processing is the same for bilinguals and monolinguals: The role of confirmation bias in testing for bilingual advantages. J Neurolinguist 27: 50–74. doi: 10.1016/j.jneuroling.2013.09.002
|
| [43] |
Paap KR, Sawi O, Dalibar C, et al. (2014). The brain mechanisms underlying the cognitive benefits of bilingualism may be very difficult to discover. AIMS Neuroscience 1: 245–256. doi: 10.3934/Neuroscience.2014.3.245
|
| [44] | Paap KR, Sawi O, Dalibar C, et al. (2015) Beyond Panglossian optimism: Larger N2 amplitudes probably signal a bilingual disadvantage in conflict monitoring. AIMS Neuroscience 2: 12–17. |
| [45] |
Paap KR, Johnson HA, Sawi O (2016) Should the search for bilingual advantages in executive functioning continue? Cortex 74: 305–314. doi: 10.1016/j.cortex.2015.09.010
|
| 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 |
Figures(1) / Tables(1)
Kenneth R. Paap, Hunter Myuz, Regina Anders-Jefferson, Lauren Mason, Brandon Zimiga. On the ambiguity regarding the relationship between sequential congruency effects, bilingual advantages in cognitive control, and the disengagement of attention[J]. AIMS Neuroscience, 2019, 6(4): 282-298. doi: 10.3934/Neuroscience.2019.4.282
DownLoad: