Results 191 to 200 of about 975,970 (227)
Some of the next articles are maybe not open access.
On Gorenstein circulant graphs
Discrete Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nikseresht, Ashkan +1 more
openaire +1 more source
On the null spaces of quartic circulant graphs
Discrete Mathematical Chemistry, 2022A circulant graph is a simple graph whose adjacency matrix can be represented in the form of a circulant matrix, while a nut graph is considered to be a graph whose null space is spanned by a single full vector.
Ivan Damnjanović
semanticscholar +1 more source
On 2-partition dimension of the circulant graphs
Journal of Intelligent & Fuzzy Systems, 2021The partition dimension is a variant of metric dimension in graphs. It has arising applications in the fields of network designing, robot navigation, pattern recognition and image processing. Let G (V (G) , E (G)) be a connected graph and Γ = {P1, P2, …,
Asim Nadeem +3 more
semanticscholar +1 more source
Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
arXiv.orgThe Marcus-Spielman-Srivastava theorem (Annals of Mathematics, 2015) for the Kadison-Singer conjecture implies the following result in spectral graph theory: For any undirected graph $G = (V,E)$ with a maximum edge effective resistance at most $\alpha ...
Surya Teja Gavva, Peng Zhang
semanticscholar +1 more source
The Lovász number of random circulant graphs
International Conference on Sampling Theory and ApplicationsThis paper addresses the behavior of the Lovász number for dense random circulant graphs. The Lovász number is a well-known semidefinite programming upper bound on the independence number.
Afonso S. Bandeira +5 more
semanticscholar +1 more source
On semi-transitive orientability of circulant graphs
Discrete Applied MathematicsA graph $G = (V, E)$ is said to be word-representable if a word $w$ can be formed using the letters of the alphabet $V$ such that for every pair of vertices $x$ and $y$, $xy \in E$ if and only if $x$ and $y$ alternate in $w$.
Eshwar Srinivasan +1 more
semanticscholar +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
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