Results 21 to 30 of about 976,099 (318)
Cellular Automata Supporting n‐Connectivity [PDF]
Mathematical Problems in Engineering, 2014 We propose a new algorithm based on cellular automation (CA) for preserving n‐connectivity, n > 1. The CA algorithm transforms an initial grid configuration in a grid with same number of holes but without 1‐connected components. Also, maximal thinning of n‐connected components, n > 1, is achieved. The grid can be used as initial for investigating
Stamatovic, Biljana +4 more
openaire +1 more source
Extremal orders of some functions connected to regular integers modulo n
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2013 Let V (n) denote the number of positive regular integers (mod n) less than or equal to n. We give extremal orders of , , , , where σ(n), ψ(n) are the sum-of-divisors function and the Dedekind function, respectively. We also give extremal orders for and ,
Brăduţ Apostol
doaj +1 more source
Spin(7)-manifolds as generalized connected sums and 3d N=1 $$ \mathcal{N}=1 $$ theories
Journal of High Energy Physics, 2018 M-theory on compact eight-manifolds with Spin(7)-holonomy is a framework for geometric engineering of 3d N=1 $$ \mathcal{N}=1 $$ gauge theories coupled to gravity.
Andreas P. Braun, Sakura Schäfer-Nameki
doaj +1 more source
Galois cohomology of SO(N)-connections
, 2023 Abstract Two different types of Fuchsian function of the second kind are possible for SU(2)-bundle on U(1)-flat-connections of Chern-Simons field. Both of two different types of Fuchsian are parametrized by the same moduli as the LF-invariant measure situated on arbitrary Galois cohomology.
openaire +1 more source
Gallai's Path Decomposition for 2-degenerate Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Gallai's path decomposition conjecture states that if $G$ is a connected graph on $n$ vertices, then the edges of $G$ can be decomposed into at most $\lceil \frac{n }{2} \rceil$ paths. A graph is said to be an odd semi-clique if it can be obtained from a
Nevil Anto, Manu Basavaraju
doaj +1 more source
Some Results on mX-N-connected Space
Iraqi Journal of Science, 2021 In this essay, we utilize m - space to specify mX-N-connected, mX-N-hyper connected and mX-N-locally connected spaces and some functions by exploiting the intelligible mX-N-open set. Some instances and outcomes have been granted to boost our tasks.
Ahmed A. Salih, Haider J. Ali
openaire +2 more sources
First-order logic with metric betweenness – the case of non-definability of some graph classes
AKCE International Journal of Graphs and CombinatoricsThe metric betweenness of a connected graph and arbitrary graphs is FO definable. Moreover, several interesting classes of graphs with strong distance properties are shown to be FO definable using metric betweenness.
Jeny Jacob, Manoj Changat
doaj +1 more source
Spanning trees for many different numbers of leaves [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous.
Kenta Noguchi, Carol T. Zamfirescu
doaj +1 more source
Products of $\scr N$-connected groups
Illinois Journal of Mathematics, 2003 Two subgroups H and K of a finite group G are said to be N -connected if the subgroup generated by x and y is a nilpotent group, for every pair of elements x in H and y in K. This paper is devoted to the study of pairwise N -connected and permutable products of finitely many groups, in the framework of formation and Fitting class theory.
Hauck, P. +2 more
openaire +2 more sources
A notion of minor-based matroid connectivity
, 2018 For a matroid $N$, a matroid $M$ is $N$-connected if every two elements of $M$ are in an $N$-minor together. Thus a matroid is connected if and only if it is $U_{1,2}$-connected.
Gershkoff, Zachary, Oxley, James
core +1 more source