A5024277827- Advanced Graph Theory Research
- Computational Geometry and Mesh Generation
- Graph Labeling and Dimension Problems
- graph theory and CDMA systems
- Mathematics and Applications
- Advanced Combinatorial Mathematics
- Geometric and Algebraic Topology
- Limits and Structures in Graph Theory
- Graph theory and applications
- Digital Image Processing Techniques
- Finite Group Theory Research
- Mathematical Dynamics and Fractals
- Advanced Materials and Mechanics
- Advanced Topology and Set Theory
- Advanced Differential Equations and Dynamical Systems
- Interconnection Networks and Systems
- Topological and Geometric Data Analysis
- Supramolecular Self-Assembly in Materials
- Quasicrystal Structures and Properties
- semigroups and automata theory
- Commutative Algebra and Its Applications
- Homotopy and Cohomology in Algebraic Topology
- Cellular Automata and Applications
- Data Management and Algorithms
- Developmental and Educational Neuropsychology
Yokohama National University
2013-2024
Seikei University
2017
John Wiley & Sons (United States)
2016
Hudson Institute
2016
Osaka Kyoiku University
2000-2005
Shimane University
2001
Keio University
1995-1996
Abstract In this paper, we shall show that an irreducible triangulation of a closed surface F 2 has at most cg vertices, where g stands for genus and c constant. © 1995, John Wiley & Sons, Inc.
In this paper, it will be shown that any two bipartite quadrangulations of closed surface are transformed into each other by kinds transformations, called the diagonal slide and rotation, up to homeomorphism, if they have same sufficiently large number vertices. © 1996 John Wiley & Sons, Inc.
Abstract It has been shown that every quadrangulation on any nonspherical orientable closed surface with a sufficiently large representativity chromatic number at most 3. In this paper, we show G nonorientable N k least 4 if cycle of odd length which cuts open into an surface. Moreover, characterize the quadrangulations torus and Klein bottle exactly By our characterization, prove 9 3, 7 3 cutting annulus even length. As application theory, admits eulerian triangulation 5 arbitrarily...
Abstract Let G be a graph and let S ⊂ V ( ). We say that is dominating in if each vertex of or adjacent to . show every triangulation on the torus Klein bottle with n vertices has set cardinality at most \documentclass{article}\usepackage{amssymb}\footskip=0pc\pagestyle{empty}\begin{document} $\frac{n}{3}$ \end{document} Moreover, we same conclusion holds for any non‐spherical surface sufficiently large representativity. These results generalize plane triangulations proved by Matheson Tarjan...