Results 1 to 10 of about 702,525 (326)
Some of the next articles are maybe not open access.
Cubical and Simplicial Sets in the Category of Quivers
Mathematical Notes, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vershinin, V. V., Muranov, Yu. V.
openaire +1 more source
Homotopy groups of cubical sets
Expositiones Mathematicae, 2023Cubical sets provide a convenient combinatorial model for the homotopy theory of spaces. A cubical set is a presheaf on the category of combinatorial cubes, just as a simplicial set is a presheaf on the category of combinatorial simplicies. In this paper, the authors take a significant step towards establishing a theory for cubical sets similar to the ...
Daniel Carranza, Krzysztof Kapulkin
openaire +2 more sources
N-Cubic sets and aggregation operators
Journal of Intelligent & Fuzzy Systems, 2019The generalization of different types of fuzzy sets is on the way since the discovery of fuzzy sets by Zadeh 1965 based on mathematical logic. Some of them are, the interval-valued fuzzy sets, N ...
Rashid Sheikh +4 more
openaire +1 more source
Cubic Spherical Neutrosophic Sets
International Journal of Neutrosophic Science, 2023This paper introduces the concept of cubic spherical neutrosophic sets (CSNSs), a geometric representation of neutrosophic sets, as well as a specification of its operational principles. In CSNs, two aggregation operators are investigated. The shape of CSNSs represents the evaluation values of alternatives with respect to criteria in a MCDM strategy ...
S. Gomathi +3 more
openaire +1 more source
Clique-Transversal Sets in Cubic Graphs
2007A clique-transversal set S of a graph G is a set of vertices of G such that S meets all cliques of G. The clique-transversal number, denoted τc(G), is the minimum cardinality of a clique-transversal set in G. In this paper we present an upper bound and a lower bound on τc(G) for cubic graphs, and characterize the extremal cubic graphs achieving the ...
Zuosong Liang +2 more
openaire +1 more source
On feedback vertex sets and nonseparating independent sets in cubic graphs
Journal of Graph Theory, 1988AbstractLet G be an undirected connected graph with n nodes. A subset F of nodes of G is a feedback vertex set (fvs) if G − F is a forest and a subset J of nodes of G is a nonseparating independent set (nsis) if no two nodes of J are adjacent and G − J is connected.
openaire +2 more sources
Korean Journal of Computational & Applied Mathematics, 1997
This paper gives a description of the geometry of the Julia set \(J_a\) of a cubic polynomial \(C(z)= -z^3+ az\) \((a\in\mathbb{C})\) and the smallest ellipse which surrounds \(J_a\).
Lee, Hung Hwan, Baek, Hun Ki
openaire +2 more sources
This paper gives a description of the geometry of the Julia set \(J_a\) of a cubic polynomial \(C(z)= -z^3+ az\) \((a\in\mathbb{C})\) and the smallest ellipse which surrounds \(J_a\).
Lee, Hung Hwan, Baek, Hun Ki
openaire +2 more sources
COMPLEX CUBIC SET AND THEIR PROPERTIES
Advances in Mathematics: Scientific Journal, 2020D. Sarmah +3 more
openaire +2 more sources