Results 71 to 80 of about 975,970 (227)
Perfect matching transitivity of circulant graphs.
Electronic Journal of Graph Theory and Applications, 2022 Summary: A graph \(G\) is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings \(M_1\) and \(M_2\) of \(G\), there is an automorphism \(f : V(G)\mapsto V(G)\) such that \(f_e (M_1)=M_2\), where \(f_e(uv)=f(u)f(v)\). In this paper, the authors completely characterize the perfect matching transitivity of circulant graphs ...
Reiter, Isaac Armando, Zhou, Ju
openaire +2 more sources
Supermagic Generalized Double Graphs 1
Discussiones Mathematicae Graph Theory, 2016 A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex.
Ivančo Jaroslav
doaj +1 more source
Continuous-Time Quantum Walks on Directed Bipartite Graphs
, 2016 This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by tuning a ...
Blattner, Marcel +5 more
core +1 more source
Algebraic invariants of edge ideals of some circulant graphs
AIMS MathematicsLet $ S $ be a polynomial ring over a field and $ I $ be an edge ideal associated with some classes of circulant graphs. We discussed the algebraic invariants, namely, regularity, projective dimension, depth, and the Stanley depth of $ S/I. $
B. Shaukat, Muhammad Ishaq, A. Ul haq
semanticscholar +1 more source
β3‐adrenoceptor agonism exerts lung protection in a rat model of bronchopulmonary dysplasia
British Journal of Pharmacology, Volume 183, Issue 10, Page 2497-2517, May 2026.The β3‐adrenoceptors agonist BRL37344 promotes lung maturation, preventing the progression of experimental bronchopulmonary dysplasia. Absract Background and Purpose Bronchopulmonary dysplasia (BPD) affects premature newborns, particularly those receiving supplemental oxygen therapy.
Alessandro Pini +14 more
wiley +1 more source
Distinguishing Number for some Circulant Graphs [PDF]
, 2014 Introduced by Albertson et al. \cite{albertson}, the distinguishing number $D(G)$ of a graph $G$ is the least integer $r$ such that there is a $r$-labeling of the vertices of $G$ that is not preserved by any nontrivial automorphism of $G$. Most of graphs
Gravier, Sylvain +2 more
core
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
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
Zero Forcing Sets and Bipartite Circulants [PDF]
, 2010 In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices are circulant matrices and we describe some of their properties.
Meyer, Seth A.
core
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