Results 71 to 80 of about 990 (211)
Decompositions of complete graphs into circulants
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mariusz Meszka +3 more
openaire +1 more source
The metric dimension of circulant graphs and their Cartesian products [PDF]
Opuscula Mathematica, 2017 Let \(G=(V,E)\) be a connected graph (or hypergraph) and let \(d(x,y)\) denote the distance between vertices \(x,y\in V(G)\). A subset \(W\subseteq V(G)\) is called a resolving set for \(G\) if for every pair of distinct vertices \(x,y\in V(G)\), there ...
Kevin Chau, Shonda Gosselin
doaj +1 more source
Journal of Combinatorial Designs, Volume 33, Issue 10, Page 379-387, October 2025.ABSTRACT The E ( s 2 )‐optimal and minimax‐optimal supersaturated designs (SSDs) with 12 rows, 11 q columns, and s max = 4 are enumerated in a computer search: there are, respectively, 34, 146, 0, 3, and 1 such designs for q = 2 , 3 , 4 , 5, and 6. Cheng and Tang proved that for q > 6, there are no such SSDs.
Luis B. Morales
wiley +1 more source
Journal of Function Spaces, 2022 For applied scientists and engineers, graph theory is a strong and vital tool for evaluating and inventing solutions for a variety of issues. Graph theory is extremely important in complex systems, particularly in computer science.
A. El-Mesady, Omar Bazighifan
doaj +1 more source
Circulant covers of trivalent circulants
, 2007 Given two graphs G1 and G2, one may ask whether or not G2 is a cover of G1. Feng and Kwak [Typical circulant double coverings of a circulant graph, Discrete Math.
Couperus, Peter
core +1 more source
Procedural Multiscale Geometry Modeling using Implicit Surfaces
Computer Graphics Forum, Volume 44, Issue 7, October 2025.Abstract Materials exhibit geometric structures across mesoscopic to microscopic scales, influencing macroscale properties such as appearance, mechanical strength, and thermal behavior. Capturing and modeling these multiscale structures is challenging but essential for computer graphics, engineering, and materials science.
Bojja Venu +2 more
wiley +1 more source
The Pfaffian property of circulant graphs
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fuliang Lu, Lianzhu Zhang, Yan Wang
openaire +2 more sources
A Class of Koszul Algebra and Some Homological Invariants through Circulant Matrices and Cycles
Journal of Mathematics, 2022 Recent advances in graph theory, linear algebra, and commutative algebra render us to tackle problems in one bough of mathematics with assistance and guidance from others.
Muhammed Nadeem +5 more
doaj +1 more source
Complete resolution of the circulant nut graph order-degree existence problem
, 2022 A circulant nut graph is a non-trivial simple graph such that its adjacency matrix is a circulant matrix whose null space is spanned by a single vector without zero elements. Regarding these graphs, the order-degree existence problem can be thought of as
Damnjanović, Ivan
core
The Directed Oberwolfach Problem With Variable Cycle Lengths: A Recursive Construction
Journal of Combinatorial Designs, Volume 33, Issue 7, Page 239-260, July 2025.ABSTRACT The directed Oberwolfach problem OP * ( m 1 , … , m k ) asks whether the complete symmetric digraph K n *, assuming n = m 1 + ⋯ + m k, admits a decomposition into spanning subdigraphs, each a disjoint union of k directed cycles of lengths m 1 , … , m k.
Suzan Kadri, Mateja Šajna
wiley +1 more source