Results 51 to 60 of about 279 (161)
Bounds on F-index of tricyclic graphs with fixed pendant vertices
The F-index F(G) of a graph G is obtained by the sum of cubes of the degrees of all the vertices in G. It is defined in the same paper of 1972 where the first and second Zagreb indices are introduced to study the structure-dependency of total π-electron ...
Akram Sana +2 more
doaj +1 more source
Uniformity in Association schemes and Coherent Configurations: Cometric Q-Antipodal Schemes and Linked Systems [PDF]
2010 Mathematics Subject Classification.
Edwin R. Van Dam +5 more
core +1 more source
Which Graphs are Determined by their Spectrum?
AMS classifications; 05C50 ...
Haemers, W.H.; id_orcid, van Dam, E.R.
core
Perturbations in a Signed Graph and its Index
In this paper we consider the behaviour of the largest eigenvalue (also called the index) of signed graphs under small perturbations like adding a vertex, adding an edge or changing the sign of an edge.
Stanić Zoran
doaj +1 more source
Uniformity in Association schemes and Coherent Configurations: Cometric Q-Antipodal Schemes and Linked Systems [PDF]
2010 Mathematics Subject Classification.
Dam, E.R. van +2 more
core
Spectral characterization of new classes of multicone graphs [PDF]
This paper deals with graphs that are known as multicone graphs. A multicone graph is a graph obtained from the join of a clique and a regular graph. Let w, l, m be natural numbers and k is a natural number.
ZEYDI ABDIAN, Ali +1 more
core +1 more source
Signed graphs with strong (anti-)reciprocal eigenvalue property
A (signed) graph is said to exhibit the strong reciprocal (anti-reciprocal) eigenvalue property (SR) (resp., (-SR)) if for any eigenvalue λ\lambda , it has 1λ\frac{1}{\lambda } (resp.,−1λ-\frac{1}{\lambda }) as an eigenvalue as well, with the same ...
Belardo Francesco, Huntington Callum
doaj +1 more source
The Maximum Order of Adjacency Matrices With a Given Rank [PDF]
AMS Subject Classification: 05B20, 05C50.Graph;Adjacency ...
Peeters, M.J.P., Haemers, W.H.
core
Pretty good state transfer among large sets of vertices [PDF]
In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1.
Sin, Peter, Chan, Ada
core +1 more source

