Results 271 to 280 of about 96,121 (306)
Some of the next articles are maybe not open access.
A study of graph spectra for comparing graphs and trees
Pattern Recognition, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard C Wilson
exaly +3 more sources
Discrete Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tianyi Bu, Shaobin Huang
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tianyi Bu, Shaobin Huang
openaire +2 more sources
Choice Reviews Online, 2012
This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association schemes, p-ranks of configurations and similar topics ...
Brouwer, A.E., Haemers, W.H.
openaire +3 more sources
This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association schemes, p-ranks of configurations and similar topics ...
Brouwer, A.E., Haemers, W.H.
openaire +3 more sources
Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li-Da Tong, Hao-Yu Yang, Xuding Zhu
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li-Da Tong, Hao-Yu Yang, Xuding Zhu
openaire +1 more source
Graphs and Combinatorics, 1987
We study lexicographic ordering of unicyclic graphs by spectral moments as well as the ordering by the largest eigenvalue. If the length of the cycle is fixed, extremal graphs in the first ordering are obtained by attaching a star and a path to a cycle. For the other ordering minimal graphs are not known.
Dragos M. Cvetkovic, Peter Rowlinson
openaire +1 more source
We study lexicographic ordering of unicyclic graphs by spectral moments as well as the ordering by the largest eigenvalue. If the length of the cycle is fixed, extremal graphs in the first ordering are obtained by attaching a star and a path to a cycle. For the other ordering minimal graphs are not known.
Dragos M. Cvetkovic, Peter Rowlinson
openaire +1 more source
2015
Product graphs have been gainfully used in literature to generate mathematical models of complex networks which inherit properties of real networks. Realizing the duplication phenomena imbibed in the definition of corona product of two graphs, we define corona graphs.
Rohan Sharma +2 more
openaire +1 more source
Product graphs have been gainfully used in literature to generate mathematical models of complex networks which inherit properties of real networks. Realizing the duplication phenomena imbibed in the definition of corona product of two graphs, we define corona graphs.
Rohan Sharma +2 more
openaire +1 more source
Empirical evaluation of network optimization via graph spectra and energy
, 2017 Attacks upon communication networks have become stealthier and more sophisticated, and hardening communication networks has become necessary to avoid service disruptions. While connectivity of networks can be improved by adding links, there are different
Egemen K Cetinkaya
exaly +2 more sources
SIAM Journal on Algebraic Discrete Methods, 1984
In this paper a method of reducing the adjacency matrix of a finite graph having an involutory automorphism to the direct sum of two submatrices is given. These submatrices can be read off from the given graph.
openaire +2 more sources
In this paper a method of reducing the adjacency matrix of a finite graph having an involutory automorphism to the direct sum of two submatrices is given. These submatrices can be read off from the given graph.
openaire +2 more sources
A Study of Graph Spectra for Comparing Graphs
Procedings of the British Machine Vision Conference 2005, 2005The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has been less popular as a representation for pattern matching for two reasons. Firstly, more than one graph may share the same spectrum. It is well known, for example, that very few trees can be uniquely
Ping Zhu, Richard C. Wilson 0001
openaire +1 more source
On the Spectra of Simplicial Rook Graphs
Graphs and Combinatorics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source