On spectral invariants of the α-mixed adjacency matrix

Detalhes bibliográficos
Autor(a) principal: Andrade, Enide
Data de Publicação: 2024
Outros Autores: Lenes, Eber, Pizarro Pamela, Robbiano, María, Rodríguez, Jonnathan
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10773/39949
Resumo: Let Gˆ be a mixed graph and α∈[0,1]. Let Dˆ(Gˆ) and Aˆ(Gˆ) be the diagonal matrix of vertex degrees and the mixed adjacency matrix of Gˆ, respectively. The α-mixed adjacency matrix of Gˆ is the matrix Aˆα(Gˆ)=αDˆ(Gˆ)+(1−α)Aˆ(Gˆ).We study some properties of Aˆα(Gˆ) associated with some type of mixed graphs, namely quasi-bipartite and pre-bipartite mixed graphs. A spectral characterization for pre-bipartite and some class of quasi-bipartite mixed graphs is given. For a mixed graph Gˆ we exploit the problem of finding the smallest α for which Aˆα(Gˆ) is positive semi-definite. This problem was proposed by Nikiforov in the context of undirected graphs. It is proven here that, for a mixed graph this number is not greater than [Formula presented] and that a connected mixed graph Gˆ with n≥2 is quasi-bipartite if and only if this number is exactly [Formula presented] The spread of the α-mixed adjacency matrix is the difference among the largest and the smallest α-mixed adjacency eigenvalue. Upper and lower bounds for the spread of the α- mixed adjacency matrix are obtained. The α-mixed Estrada index of Gˆ is the sum of the exponentials of the eigenvalues of Aˆα(Gˆ). In this paper, bounds for the eigenvalues of Aˆα(Gˆ) are established and, using these bounds some sharp bounds on the mixed Estrada index of Aˆα(Gˆ) are presented
id RCAP_4a56b95cfe39b3b32c5ab9ab8d60634c
oai_identifier_str oai:ria.ua.pt:10773/39949
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling On spectral invariants of the α-mixed adjacency matrixMixed graphMixed Laplacian matrixα-mixed adjacency matrixSpreadα-mixed Estrada indexLet Gˆ be a mixed graph and α∈[0,1]. Let Dˆ(Gˆ) and Aˆ(Gˆ) be the diagonal matrix of vertex degrees and the mixed adjacency matrix of Gˆ, respectively. The α-mixed adjacency matrix of Gˆ is the matrix Aˆα(Gˆ)=αDˆ(Gˆ)+(1−α)Aˆ(Gˆ).We study some properties of Aˆα(Gˆ) associated with some type of mixed graphs, namely quasi-bipartite and pre-bipartite mixed graphs. A spectral characterization for pre-bipartite and some class of quasi-bipartite mixed graphs is given. For a mixed graph Gˆ we exploit the problem of finding the smallest α for which Aˆα(Gˆ) is positive semi-definite. This problem was proposed by Nikiforov in the context of undirected graphs. It is proven here that, for a mixed graph this number is not greater than [Formula presented] and that a connected mixed graph Gˆ with n≥2 is quasi-bipartite if and only if this number is exactly [Formula presented] The spread of the α-mixed adjacency matrix is the difference among the largest and the smallest α-mixed adjacency eigenvalue. Upper and lower bounds for the spread of the α- mixed adjacency matrix are obtained. The α-mixed Estrada index of Gˆ is the sum of the exponentials of the eigenvalues of Aˆα(Gˆ). In this paper, bounds for the eigenvalues of Aˆα(Gˆ) are established and, using these bounds some sharp bounds on the mixed Estrada index of Aˆα(Gˆ) are presentedElsevier2026-01-30T00:00:00Z2024-01-30T00:00:00Z2024-01-30info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/39949eng0166-218X10.1016/j.dam.2023.11.010Andrade, EnideLenes, EberPizarro PamelaRobbiano, MaríaRodríguez, Jonnathaninfo:eu-repo/semantics/embargoedAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-02-22T12:17:51Zoai:ria.ua.pt:10773/39949Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:09:55.520782Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv On spectral invariants of the α-mixed adjacency matrix
title On spectral invariants of the α-mixed adjacency matrix
spellingShingle On spectral invariants of the α-mixed adjacency matrix
Andrade, Enide
Mixed graph
Mixed Laplacian matrix
α-mixed adjacency matrix
Spread
α-mixed Estrada index
title_short On spectral invariants of the α-mixed adjacency matrix
title_full On spectral invariants of the α-mixed adjacency matrix
title_fullStr On spectral invariants of the α-mixed adjacency matrix
title_full_unstemmed On spectral invariants of the α-mixed adjacency matrix
title_sort On spectral invariants of the α-mixed adjacency matrix
author Andrade, Enide
author_facet Andrade, Enide
Lenes, Eber
Pizarro Pamela
Robbiano, María
Rodríguez, Jonnathan
author_role author
author2 Lenes, Eber
Pizarro Pamela
Robbiano, María
Rodríguez, Jonnathan
author2_role author
author
author
author
dc.contributor.author.fl_str_mv Andrade, Enide
Lenes, Eber
Pizarro Pamela
Robbiano, María
Rodríguez, Jonnathan
dc.subject.por.fl_str_mv Mixed graph
Mixed Laplacian matrix
α-mixed adjacency matrix
Spread
α-mixed Estrada index
topic Mixed graph
Mixed Laplacian matrix
α-mixed adjacency matrix
Spread
α-mixed Estrada index
description Let Gˆ be a mixed graph and α∈[0,1]. Let Dˆ(Gˆ) and Aˆ(Gˆ) be the diagonal matrix of vertex degrees and the mixed adjacency matrix of Gˆ, respectively. The α-mixed adjacency matrix of Gˆ is the matrix Aˆα(Gˆ)=αDˆ(Gˆ)+(1−α)Aˆ(Gˆ).We study some properties of Aˆα(Gˆ) associated with some type of mixed graphs, namely quasi-bipartite and pre-bipartite mixed graphs. A spectral characterization for pre-bipartite and some class of quasi-bipartite mixed graphs is given. For a mixed graph Gˆ we exploit the problem of finding the smallest α for which Aˆα(Gˆ) is positive semi-definite. This problem was proposed by Nikiforov in the context of undirected graphs. It is proven here that, for a mixed graph this number is not greater than [Formula presented] and that a connected mixed graph Gˆ with n≥2 is quasi-bipartite if and only if this number is exactly [Formula presented] The spread of the α-mixed adjacency matrix is the difference among the largest and the smallest α-mixed adjacency eigenvalue. Upper and lower bounds for the spread of the α- mixed adjacency matrix are obtained. The α-mixed Estrada index of Gˆ is the sum of the exponentials of the eigenvalues of Aˆα(Gˆ). In this paper, bounds for the eigenvalues of Aˆα(Gˆ) are established and, using these bounds some sharp bounds on the mixed Estrada index of Aˆα(Gˆ) are presented
publishDate 2024
dc.date.none.fl_str_mv 2024-01-30T00:00:00Z
2024-01-30
2026-01-30T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10773/39949
url http://hdl.handle.net/10773/39949
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 0166-218X
10.1016/j.dam.2023.11.010
dc.rights.driver.fl_str_mv info:eu-repo/semantics/embargoedAccess
eu_rights_str_mv embargoedAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799137749666627584