Results 41 to 50 of about 137,715 (267)
New Spectral Bounds on the Chromatic Number Encompassing all Eigenvalues of the Adjacency Matrix [PDF]
Electronic Journal of Combinatorics, 2012 The purpose of this article is to improve existing lower bounds on the chromatic number chi. Let mu_1,...,mu_n be the eigenvalues of the adjacency matrix sorted in non-increasing order. First, we prove the lower bound chi >= 1 + max_m {sum_{i=1}^m mu_i /
P. Wocjan, C. Elphick
semanticscholar +1 more source
Hermitian Adjacency Matrices of Mixed Graphs [PDF]
European Journal of Pure and Applied Mathematics, 2021 The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of digraphs or mixed ...
Mohammad Abudayah, O. Alomari, T. Sander
semanticscholar +1 more source
图的Aα-特征多项式系数的一个注记(A note on the coefficients of the Aα-characteristic polynomial of a graph)
Zhejiang Daxue xuebao. Lixue ban, 2019 Let G be a graph on n vertices, and let A( G ) and D ( G ) denote the adjacency matrix and the degree matrix of G, respectively. Define Aα ( G )= αD ( G )+( 1 - α ) A( G ) for any real α ∈ [ 0,1 ].
LIUShunyi,(柳顺义) +1 more
doaj +1 more source
Adjacency Matrix of Real-World (nine cities)
, 2021 This readme.txt file was generated on 2021-02-06 by Mohsen Ghaffari and Dr. Mansoor Davoodi-Monfared. GENERAL INFORMATION Adjacency Matrix of Real-World (Nine cities) Principal Investigator Contact Information Mohsen Ghaffari Department of ...
Ghaffari, M (via Mendeley Data)
core +1 more source
Dynamic Correlation Adjacency-Matrix-Based Graph Neural Networks for Traffic Flow Prediction [PDF]
, 2023 Modeling complex spatial and temporal dependencies in multivariate time series data is crucial for traffic forecasting. Graph convolutional networks have proved to be effective in predicting multivariate time series. Although a predefined graph structure
Adnan Mahmood +9 more
core +1 more source
On the Number of α-Labeled Graphs
Discussiones Mathematicae Graph Theory, 2018 When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of the graph, it becomes an α-labeling. This is the most restrictive type of difference-vertex labeling and it is located at the very core of this research ...
Barrientos Christian, Minion Sarah
doaj +1 more source
Ranking hubs and authorities using matrix functions
, 2013 The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of undirected networks.
Estrada, Ernesto +2 more
core +1 more source
α-Adjacency: A generalization of adjacency matrices
, 2019 B. Shader and W. So introduced the idea of the skew adjacency matrix. Their idea was to give an orientation δ to a simple undirected graph G from which a skew adjacency matrix S(Gδ ) is created. The α-adjacency matrix extends this
McDonald, Judi +2 more
core +1 more source
Modified edge adjacency matrices from the edge adjacency matrix of a sample graph network.
, 2023 Modified edge adjacency matrices from the edge adjacency matrix of a sample graph network.
Ertugrul Taciroglu (17692267) +3 more
core +1 more source
Perturbation of the α-spectral radius of complete multipartite graphs
上海师范大学学报. 自然科学版Let G be a graph and α∈[0, 1), Nikiforov merged the adjacency matrix and the signless Laplacian matrix to Aα(G)=αD(G)+(1-α)A(G), where D(G), A(G) are the degree diagonal matrix and the adjacency matrix of G, respectively.
WU Yuhao +3 more
doaj +1 more source