A5063551926- Advanced Graph Theory Research
- Point processes and geometric inequalities
- Computational Geometry and Mesh Generation
- Mathematics and Applications
- Limits and Structures in Graph Theory
- Homotopy and Cohomology in Algebraic Topology
- graph theory and CDMA systems
- Advanced Combinatorial Mathematics
- Topological and Geometric Data Analysis
- Graph Labeling and Dimension Problems
- Geometric and Algebraic Topology
- Advanced Topology and Set Theory
- Graph theory and applications
- Interconnection Networks and Systems
- Finite Group Theory Research
- Digital Image Processing Techniques
- Advanced Topics in Algebra
- Mathematical Dynamics and Fractals
- Complexity and Algorithms in Graphs
- Advanced Numerical Analysis Techniques
- Algebraic structures and combinatorial models
- Structural Analysis and Optimization
- Advanced Theoretical and Applied Studies in Material Sciences and Geometry
- Commutative Algebra and Its Applications
- Functional Equations Stability Results
Universidad Nacional Autónoma de México
2015-2025
Universitat Rovira i Virgili
2020-2024
Polytechnic University of Queretaro
2022
Czech Academy of Sciences, Institute of Mathematics
2020-2021
Universitat Politècnica de Catalunya
2009-2019
Consejo Nacional de Humanidades, Ciencias y Tecnologías
2018-2019
Mathematics Research Center
1995-2019
Autonomous University of Queretaro
2018-2019
Institute of Mathematical Sciences
2011-2018
Université de Montpellier
2013-2017
Abstract In this paper, we present a unique four‐dimensional body of constant width based on the classical notion focal conics.
Given a graph G = ( V , E ) function f : → { 0 1 2 ⋯ } is said to be total dominating if ∑ u ∈ N v > for every where denotes the open neighbourhood of v. Let i x . We say that weak Roman and vertex there exists ∩ ∪ such ′ defined by − whenever \ as well. The weight w In this article, we introduce study domination number G, denoted γ t r which minimum among all functions on G. show close relationship between novel parameter other parameters graph. Furthermore, obtain general bounds and,...
A total dominating set D of a graph G is said to be secure if for every vertex u ∈ V ( ) \ , there exists v which adjacent u, such that { } ∪ as well. The domination number the minimum cardinality among all sets G. In this article, we obtain new relationships between and other parameters: namely independence number, matching parameters. Some our results are tight bounds improve some well-known results.
Variations and generalizations of several classical theorems concerning characterizations ellipsoids are developed. In particular, these lead to a short comprehensible proof the false centre theorem.
Abstract For a strongly connected digraph D the restricted arc‐connectivity λ′( ) is defined as minimum cardinality of an arc‐cut over all arc‐cuts S satisfying that ‐ has non‐trivial strong component 1 such V ( contains arc. In this paper we prove every on at least 4 vertices and degree 2 λ′ ‐connected ≤ξ′( ), where ξ′( arc‐degree . Also in introduce concept super‐ digraphs provide sufficient condition for s ‐geodetic to be λ′. Further, show h ‐iterated line L particular © 2012 Wiley...