Results 51 to 60 of about 332 (178)
Accelerating Conjugate Gradient Solvers for Homogenization Problems With Unitary Neural Operators
International Journal for Numerical Methods in Engineering, Volume 127, Issue 5, 15 March 2026.ABSTRACT Rapid and reliable solvers for parametric partial differential equations (PDEs) are needed in many scientific and engineering disciplines. For example, there is a growing demand for composites and architected materials with heterogeneous microstructures.
Julius Herb, Felix Fritzen
wiley +1 more source
Definition and Computation of Tensor‐Based Generalized Function Composition
Numerical Linear Algebra with Applications, Volume 33, Issue 1, February 2026.ABSTRACT Functions are fundamental to mathematics as they offer a structured and analytical framework to express relations between variables. While scalar and matrix‐based functions are well‐established, higher‐order tensor‐based functions have not been as extensively explored.
Remy Boyer
wiley +1 more source
Solving Two Conjectures regarding Codes for Location in Circulant Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Identifying and locating-dominating codes have been widely studied in circulant graphs of type $C_n(1,2, \ldots, r)$, which can also be viewed as power graphs of cycles.
Ville Junnila +2 more
doaj +1 more source
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
Computing Exact Edge Geodetic Numbers in K‐Powered Path and Cycle Graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2026, Issue 1, 2026.For any two vertices u and v in a graph G, u − v geodesic is the shortest path between u and v. A set S of vertices in G is called an edge geodetic cover for G if every edge in G belongs to a geodesic between two vertices of S. The minimum cardinality of an edge geodetic cover is called the edge geodetic number and is denoted by eg(G).
A. Baniabedalruhman +3 more
wiley +1 more source
Open Locating-Dominating Sets in Circulant Graphs
Discussiones Mathematicae Graph Theory, 2022 Location detection problems have been studied for a variety of applications including finding faults in multiprocessors, contaminants in public utilities, intruders in buildings and facilities, and for environmental monitoring using wireless sensor ...
Givens Robin M. +2 more
doaj +1 more source
Searching Circulant Graphs. [PDF]
, 2011 [Abstract Not Available]
Diner, Öznur Yaşar +2 more
openaire +1 more source
On Distinct Inertias of Lanzhou Matrices Versus Adjacency Matrices in Some Graph Classes
Journal of Mathematics, Volume 2026, Issue 1, 2026.The Lanzhou matrix is a recently introduced graph matrix that depends on the adjacency relation and on the degrees of each vertex in the graph and its complement, thereby providing a spectral perspective on graph structure that differs from the classical adjacency matrix.
Madhumitha K. V. +4 more
wiley +1 more source
Broader families of cordial graphs
Indonesian Journal of Combinatorics, 2021 A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and the number of vertices labeled 1 differ by at most 1, and the number of edges of weight 0 and the number of edges of weight 1 differ by at most 1.
Christian Barrientos, Sarah Minion
doaj +1 more source
Products of Circulant Graphs Are Metacirculant
Journal of Combinatorial Theory, Series B, 2002 Broere and Hattingh studied \(B\)-products of graphs (introduced by Imrich and Izbicki) and proved that the lexicographic product of two circulant graphs is again circulant, but this is not the case with other products. In the present paper any \(B\)-product of two circulant graphs is proved to be a metacirculant graph with parameters that are easily ...
openaire +1 more source