Results 1 to 10 of about 976,099 (318)
On n-connected minors of the es-splitting binary matroids [PDF]
Electronic Journal of Graph Theory and Applications, 2021 The es-splitting operation on an n-connected binary matroid may not yield an n-connected matroid for (n ≥ 3). In this paper, we show that given an n-connected binary matroid M of rank r, the resulting es-splitting binary matroid has an n-connected minor ...
Prashant Pralhad Malavadkar +2 more
doaj +4 more sources
On n-connected splitting matroids [PDF]
AKCE International Journal of Graphs and Combinatorics, 2019 In general, the splitting operation on a binary matroid M does not preserve the connectivity of M. In this paper, we provide sufficient conditions to preserve n-connectedness of a binary matroid under splitting operation.
Y.M. Borse, Ganesh Mundhe
doaj +3 more sources
Human Activity Recognition with Wearables using Federated Learning
Proceedings of the International Conference on Applied Innovations in IT, 2023 The increasing use of Wearable devices opens up the use of a wide range of applications. Using different models, these devices can be of great use in Human Activity Recognition (HAR), where the main goal is to process information obtained from sensors ...
Borche Jovanovski +7 more
doaj +1 more source
Critically n-Connected Graphs [PDF]
Proceedings of the American Mathematical Society, 1972 The following result is proved. Every n-connected graph contains either a vertex whose removal results in a graph which is also n-connected or a vertex of degree less than (3n 1)/2. Introduction. A graph G is said to be n-connected if the removal of fewer than n vertices from G neither disconnects it nor reduces it to the trivial graph consisting of a ...
Chartrand, G., Kaugars, A., Lick, D. R.
openaire +1 more source
SU(n)-connections and noncommutative differential geometry [PDF]
Journal of Geometry and Physics, 1998 We study the noncommutative differential geometry of the algebra of endomorphisms of any SU(n)-vector bundle. We show that ordinary connections on such SU(n)-vector bundle can be interpreted in a natural way as a noncommutative 1-form on this algebra for the differential calculus based on derivations.
Dubois-Violette, Michel, Masson, Thierry
openaire +3 more sources
The open monophonic chromatic number of a graph [PDF]
Journal of Hyperstructures, 2023 A set P of vertices in a connected graph G is called open monophonic chromatic set if P is both an open monophonic set and a chromatic set. The minimum cardinality among the set of all open monophonic chromatic sets is called open monophonic chromatic ...
Mohammed Abdul Khayyoom +1 more
doaj +1 more source
Two-Step Method for Assessing Similarity of Random Sets
Image Analysis and Stereology, 2021 The paper concerns a new statistical method for assessing dissimilarity of two random sets based on one realisation of each of them. The method focuses on shapes of the components of the random sets, namely on the curvature of their boundaries together ...
Vesna Gotovac Đogaš +5 more
doaj +1 more source
On k-critical, n-connected graphs
Discrete Mathematics, 1977 AbstractA graph G which is n-connected (but not (n + 1)-connected)is defined to be k-critical if for every S ⊆ V(G), where |S|⩽k, the connectivity of G − S is n − |S|. We will say that G is an (n∗,k∗) graph if G is n-connected (but not (n + 1)-connected) and k-critical (but not (k + 1)- critical).
Maurer, Stephen, Slater, Peter J.
openaire +2 more sources
Edge-fault-tolerant strong Menger edge connectivity of bubble-sort graphs
AIMS Mathematics, 2021 This paper studies the edge-fault-tolerant strong Menger edge connectivity of $ n $-dimensional bubble-sort graph $ B_{n} $. We give the values of faulty edges that $ B_{n} $ can tolerant when $ B_{n} $ is strongly Menger edge connected under two ...
Yanling Wang , Shiying Wang
doaj +1 more source
Decomposition of the Product of Cycles Based on Degree Partition
Discussiones Mathematicae Graph Theory, 2019 The Cartesian product of n cycles is a 2n-regular, 2n-connected and bi- pancyclic graph. Let G be the Cartesian product of n even cycles and let 2n = n1+ n2+ ・ ・ ・ + nkwith k ≥ 2 and ni≥ 2 for each i. We prove that if k = 2, then G can be decomposed into
Borse Y. M., Shaikh S. R.
doaj +1 more source