Results 161 to 170 of about 6,790 (196)
Modeling the SARS-CoV-2 epidemic and the efficacy of different vaccines across different network structures. [PDF]
PLoS OneHartvigsen G, Dimitroff Y.
europepmc +1 more source
Adherence to the Mediterranean Diet Mitigates Inflammation and Hospital Stay in Frail Elderly Patients: A Moderation Analysis. [PDF]
NutrientsLo Buglio A +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Star Extremal Circulant Graphs
SIAM Journal on Discrete Mathematics, 1999A graph is said to be star extremal if its fractional chromatic number is equal to its circular chromatic number. In this paper, it is proven that some families of circulant graphs are star extremal. The results generalize some earlier results obtained by \textit{A. F. Sidorenko} [Discrete Math.
Lih, Ko-Wei +2 more
openaire +1 more source
On Gorenstein circulant graphs
Discrete Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nikseresht, Ashkan +1 more
openaire +1 more source
Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), 2002
A fundamental problem in designing massively parallel computer systems and fast communication networks is the maximization of the number of nodes given a diameter and degree of a network. This maximal number is bounded above by the Moore bound. For undirected circulant graphs, an upper bound is also given but no exact formula has been found yet for ...
openaire +1 more source
A fundamental problem in designing massively parallel computer systems and fast communication networks is the maximization of the number of nodes given a diameter and degree of a network. This maximal number is bounded above by the Moore bound. For undirected circulant graphs, an upper bound is also given but no exact formula has been found yet for ...
openaire +1 more source
Generalized Recursive Circulant Graphs
IEEE Transactions on Parallel and Distributed Systems, 2012In this paper, we propose a new class of graphs called generalized recursive circulant graphs which is an extension of recursive circulant graphs. While retaining attractive properties of recursive circulant graphs, the new class of graphs achieve more flexibility in varying the number of vertices. Some network properties of recursive circulant graphs,
null Shyue-Ming Tang +2 more
openaire +1 more source
Resolvability in circulant graphs
Acta Mathematica Sinica, English Series, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Salman, Muhammad +2 more
openaire +1 more source
Quaestiones Mathematicae, 1990
ABSTRACT Graph products of circulants are studied. It is shown that if G and H are circulants and gcd(v(G), v(H)) = 1, then every B-product of G and H is again a circulant. We prove that if m ≠ 2, then the generalised prism K2 mxCn is a circulant iff n is odd. A similar result is deduced for the conjunction.
Izak Broere, Johannes H. Hattingh
openaire +1 more source
ABSTRACT Graph products of circulants are studied. It is shown that if G and H are circulants and gcd(v(G), v(H)) = 1, then every B-product of G and H is again a circulant. We prove that if m ≠ 2, then the generalised prism K2 mxCn is a circulant iff n is odd. A similar result is deduced for the conjunction.
Izak Broere, Johannes H. Hattingh
openaire +1 more source
Circulant Double Coverings of a Circulant Graph of Valency Four
Graphs and Combinatorics, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feng, RQ, Kwak, JH
openaire +3 more sources