Results 251 to 260 of about 587,527 (280)

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.
Bollobás, Béla, Saito, Akira, Wormald, N. C.   +2 more
openaire   +2 more sources

P4-decompositions of regular graphs

Journal of Graph Theory, 1999
It is shown that every simple \(r\)-regular graph \(G\) admits a balanced \(P_4\)-decomposition if \(r \equiv 0\pmod 3\) and \(G\) has no cut-edge when \(r\) is odd. It is also shown that a connected 4-regular graph \(G\) admits a \(P_4\)-decomposition if and only if \(| E(G)| \equiv 0\pmod 3\) by characterizing graphs of maximum degree 4 that admit a ...
Heinrich, Katherine, Liu, Jiping, Yu, Minli   +2 more
openaire   +2 more sources

REGULAR k -COVERED GRAPHS

Acta Mathematica Scientia, 1989
Summary: A graph G is k-covered if each edge of G belongs to a k-factor of G. We determine some values of k for which every regular graph with edge- connectivity \(\lambda\) is k-covered.
openaire   +2 more sources

Regular 2-Graphs

Proceedings of the London Mathematical Society, 1977
openaire   +1 more source

Distance-Regular Graphs

1989
Brouwer, A.E., Cohen, A.M., Neumaier, A.
openaire   +2 more sources

Regular bipolar fuzzy graphs

Neural Computing and Applications, 2011
Muhammad Akram
exaly  

Observability in Connected Strongly Regular Graphs and Distance Regular Graphs

IEEE Transactions on Control of Network Systems, 2014
Alain Y Kibangou
exaly  

Regular Graphs

2007
Akihito Hora, Nobuaki Obata
openaire   +1 more source

Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs

IEEE Transactions on Network Science and Engineering, 2015
Magnus Egerstedt, Jeff S Shamma
exaly  

Sparse regular random graphs: Spectral density and eigenvectors

Annals of Probability, 2012
Ioana Dumitriu
exaly