Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Jonnathan Rodríguez"'
Publikováno v:
Mathematics, Vol 12, Iss 1, p 2 (2023)
In this paper, we introduce the concepts of Harary Laplacian-energy-like for a simple undirected and connected graph G with order n. We also establish novel matrix results in this regard. Furthermore, by employing matrix order reduction techniques, w
Externí odkaz:
https://doaj.org/article/9f586be5048d461da4226ff848b7ac85
Publikováno v:
Mathematics, Vol 10, Iss 16, p 2932 (2022)
Let G be a simple undirected graph on n vertices. V. Nikiforov studied hybrids of AG and DG and defined the matrix AαG for every real α∈[0,1] as AαG=αDG+(1−α)AG. In this paper, we define the generalized Randić matrix for graph G, and we int
Externí odkaz:
https://doaj.org/article/5bdcff0006d74de28f36d7e1ffdb05ff
Autor:
Evgenii S. Baranovskii, Eber Lenes, Exequiel Mallea-Zepeda, Jonnathan Rodríguez, Lautaro Vásquez
Publikováno v:
Symmetry, Vol 13, Iss 11, p 2050 (2021)
We study an optimal control problem for the stationary Stokes equations with variable density and viscosity in a 2D bounded domain under mixed boundary conditions. On in-flow and out-flow parts of the boundary, nonhomogeneous Dirichlet boundary condi
Externí odkaz:
https://doaj.org/article/8b6e40dc678a44b6bad2815853e37fba
Autor:
Jonnathan Rodríguez, Hans Nina
Publikováno v:
Mathematics, Vol 9, Iss 8, p 811 (2021)
Let G be a graph on n vertices. The Estrada index of G is an invariant that is calculated from the eigenvalues of the adjacency matrix of a graph. V. Nikiforov studied hybrids of A(G) and D(G) and defined the Aα-matrix for every real α∈[0,1] as:
Externí odkaz:
https://doaj.org/article/2be7c46aee6d42b99f097dadc3827891
Publikováno v:
Mathematics, Vol 8, Iss 10, p 1668 (2020)
Let G be a graph, for any real 0≤α≤1, Nikiforov defines the matrix Aα(G) as Aα(G)=αD(G)+(1−α)A(G), where A(G) and D(G) are the adjacency matrix and diagonal matrix of degrees of the vertices of G. This paper presents some extremal results
Externí odkaz:
https://doaj.org/article/e9a176ada2ab4aa7bfe213bac70e6dc6
Publikováno v:
Symmetry, Vol 10, Iss 7, p 252 (2018)
The total graph of G, T(G) is the graph whose vertex set is the union of the sets of vertices and edges of G, where two vertices are adjacent if and only if they stand for either incident or adjacent elements in G. For k≥2, the k-th iterated total
Externí odkaz:
https://doaj.org/article/6a706afa9d0e4d7fae0f1e2ff4bf0718
Publikováno v:
Linear Algebra and its Applications. 659:55-72
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f8410425e3cea8367f053e74ad66dc9
https://doi.org/10.1016/j.laa.2022.11.014
https://doi.org/10.1016/j.laa.2022.11.014
Autor:
Juan R. Carmona, Jonnathan Rodríguez
Publikováno v:
Linear and Multilinear Algebra. 70:4792-4803
Let D be a simple digraph with eigenvalues z1,z2,…,zn. The energy of D is defined as E(D)=∑i=1n|Re(zi)|, where Re(zi) is the real part of the eigenvalue zi. In this paper, a lower bound for the spe...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64538084c51cfea9d3ab8b7fb0f8092a
https://doi.org/10.1080/03081087.2021.1899109
https://doi.org/10.1080/03081087.2021.1899109
A mixed graph $\hat{G}$ is a graph where two vertices can be connected by an edge or by an arc (directed edge). The adjacency matrix , $\hat{A}(\hat{G})$, of a mixed graph has rows and columns indexed by the set of vertices of $\hat{G}$, being its $\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d917664efdec332a87dfcab894a94b9a
http://hdl.handle.net/10773/33415
http://hdl.handle.net/10773/33415
Publikováno v:
Polycyclic Aromatic Compounds. 42:2013-2030
The spectral moments of the edge adjacency matrix and adjacency matrix recently have been successfully employed in quantitative structure–property relationship and quantitative structure–activity r...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0938cc1f5dc12ccb08b3743b27dfdf63
https://doi.org/10.1080/10406638.2020.1823860
https://doi.org/10.1080/10406638.2020.1823860