Results 271 to 280 of about 96,525 (309)

Interlacing eigenvalues and graphs.

Haemers, W.H.
core  

Which graphs are determined by their spectrum?.

Dam, E.R. van, Haemers, W.H.
core  

ℓ1-Rigid Graphs.

Deza, M.M., Laurent, M.
core  

Uniformly packed codes and more distance regular graphs from crooked functions.

Dam, E.R. van, Fon-der-Flaass, D.
core  

Characterizing distance regularity of graphs by the spectrum.

Koolen, J.H., Spence, E., Dam, E.R. van, Haemers, W.H.   +3 more
core  

Distance-regularity and the spectrum of graphs.

Haemers, W.H.
core  

Some of the next articles are maybe not open access.

Related searches:

Regular factors of regular graphs

Journal of Graph Theory, 1985
AbstractGiven r ⩾ 3 and 1 ⩽ λ ⩽ r, we determine all values of k for which every r‐regular graph with edge‐connectivity λ has a k‐factor.
Béla Bollobás, Akira Saito, Nicholas C. Wormald   +2 more
openaire   +2 more sources

Equimatchable Regular Graphs

Journal of Graph Theory, 2017
AbstractA graph is called equimatchable if all of its maximal matchings have the same size. Kawarabayashi, Plummer, and Saito showed that the only connected equimatchable 3‐regular graphs are K4 and K3, 3. We extend this result by showing that for an odd positive integer r, if G is a connected equimatchable r‐regular graph, then .
Saieed Akbari, Amir Hossein Ghodrati, Mohammad Ali Hosseinzadeh, Ali Iranmanesh   +3 more
openaire   +1 more source