Results 21 to 30 of about 173 (142)

Euler numbers and diametral paths in Fibonacci cubes, Lucas cubes and alternate Lucas cubes

Discrete Mathematics, Algorithms and Applications, 2023
The diameter of a graph is the maximum distance between pairs of vertices in the graph. A pair of vertices whose distance is equal to its diameter is called diametrically opposite vertices. The collection of shortest paths between diametrically opposite vertices is referred as diametral paths.
Ömer Eğeci̇oğlu, Elif Saygi, Zülfükar Saygi   +2 more
openaire   +4 more sources

Horadam–Lucas Cubes

Axioms
In this paper, we introduce a novel class of graphs referred to as the Horadam–Lucas cubes. This class extends the concept of Lucas cubes and retains numerous desirable properties associated with them.
Elif Tan, Luka Podrug, Vesna Iršič Chenoweth   +2 more
doaj   +1 more source

Micromagnetic Constraints on the Grain Size Dependence and Magnetic Stability of Sub‐Micron Monoclinic Pyrrhotite (Fe7S8)

Journal of Geophysical Research: Solid Earth, Volume 131, Issue 2, February 2026.
Abstract We present the first micromagnetic simulations for sub‐micron monoclinic 4C pyrrhotite (Fe7S8 ${\text{Fe}}_{7}{\mathrm{S}}_{8}$), a common mineral in rocks and sediments and an important mineral in paleomagnetic studies. Previous experimental studies on the magnetic properties of pyrrhotite had limited control over granulometry and focused ...
Wyn Williams, Adrian R. Muxworthy, Ualisson Donardelli Bellon, Lesleis Nagy, Alison A. Cowan, Miguel A. Valdez‐Grijalva, Andrew P. Roberts   +6 more
wiley   +1 more source

Computational Homogenization in Three‐Dimensional Magnetostatics Using Empirically Corrected Cluster Cubature (E3C) Hyper‐Reduction

International Journal for Numerical Methods in Engineering, Volume 126, Issue 22, 30 November 2025.
ABSTRACT The recently published hyper‐reduction method “Empirically Corrected Cluster Cubature” (E3C) is applied for the first time in three dimensions (here magnetostatics). The method is verified to give accurate results even for a small number of integration points, such as 15 for 3D microstructure simulations.
Hauke Goldbeck, Stephan Wulfinghoff
wiley   +1 more source

A classification of infinite staircases for Hirzebruch surfaces

Journal of Topology, Volume 18, Issue 1, March 2025.
Abstract The ellipsoid embedding function of a symplectic manifold gives the smallest amount by which the symplectic form must be scaled in order for a standard ellipsoid of the given eccentricity to embed symplectically into the manifold. It was first computed for the standard four‐ball (or equivalently, the complex projective plane) by McDuff and ...
Nicki Magill, Ana Rita Pires, Morgan Weiler   +2 more
wiley   +1 more source

On disjoint hypercubes in Fibonacci cubes

Discrete Applied Mathematics, 2015
The {\em Fibonacci cube} of dimension $n$, denoted as $ \_n$, is the subgraph of $n$-cube $Q\_n$ induced by vertices with no consecutive 1's. We study the maximum number of disjoint subgraphs in $ \_n$ isomorphic to $Q\_k$, and denote this number by $q\_k(n)$.
Gravier, Sylvain, Mollard, Michel, Spacapan, Simon, Zemljic, Sara   +3 more
openaire   +3 more sources

Connectivity of Markoff mod‐p graphs and maximal divisors

Proceedings of the London Mathematical Society, Volume 130, Issue 2, February 2025.
Abstract Markoff mod‐p$p$ graphs are conjectured to be connected for all primes p$p$. In this paper, we use results of Chen and Bourgain, Gamburd, and Sarnak to confirm the conjecture for all p>3.45·10392$p > 3.45\cdot 10^{392}$. We also provide a method that quickly verifies connectivity for many primes below this bound.
Jillian Eddy, Elena Fuchs, Matthew Litman, Daniel E. Martin, Nico Tripeny   +4 more
wiley   +1 more source

A New Box‐Counting‐Based‐Image Fractal Dimension Estimation Method for Discharges Recognition on Polluted Insulator Model

IET Science, Measurement &Technology, Volume 19, Issue 1, January/December 2025.
This study presents an innovative approach to identify electrical discharges by proposing an algorithm involving the concept of fractal geometry. Based on the box‐counting method, our algorithm is developed to detect and track the progression of electrical discharges leading to flashover.
Imene Ferrah, Youcef Benmahamed, Hayder K. Jahanger, Madjid Teguar, Omar Kherif   +4 more
wiley   +1 more source

Counting disjoint hypercubes in Fibonacci cubes

Discrete Applied Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saygi, Elif, Egecioglu, Omer
openaire   +3 more sources

Strong bounds and exact solutions to the minimum broadcast time problem

International Transactions in Operational Research, Volume 32, Issue 1, Page 314-352, January 2025.
Abstract Given a graph and a subset of its nodes, referred to as source nodes, the minimum broadcast time problem asks for the minimum number of steps in which a signal can be transmitted from the sources to all other nodes in the graph. In each step, the sources and the nodes that already have received the signal can forward it to at most one of their
Marika Ivanova, Dag Haugland, Bård Hennning Tvedt   +2 more
wiley   +1 more source