A5101642885- Advanced Graph Theory Research
- Limits and Structures in Graph Theory
- Graph theory and applications
- Graph Labeling and Dimension Problems
- graph theory and CDMA systems
- Complexity and Algorithms in Graphs
- Interconnection Networks and Systems
- Advanced Topology and Set Theory
- Optimization and Search Problems
- Virtual Reality Applications and Impacts
- Computational Geometry and Mesh Generation
- Finite Group Theory Research
- Cellular Automata and Applications
- Cryptography and Data Security
- semigroups and automata theory
- Interstitial Lung Diseases and Idiopathic Pulmonary Fibrosis
- Congenital limb and hand anomalies
- Reconstructive Surgery and Microvascular Techniques
- Fibroblast Growth Factor Research
- Computability, Logic, AI Algorithms
- Nuclear Receptors and Signaling
- Advanced Optical Network Technologies
- Game Theory and Voting Systems
- Chaos-based Image/Signal Encryption
- Cloud Data Security Solutions
Showa University
2025
Showa University Hospital
2025
Nihon University
2014-2024
The University of Tokyo
1983-2024
Sapporo Medical University
2020-2021
University of Strathclyde
2020
Beijing Institute of Technology
2016
Tokyo University of Science
1983-2013
North Dakota State University
1994
Tohoku University
1987-1991
Abstract As a method of sharing secret, e.g., secret key, Shamir's (k, n) threshold is well known. However, has problem in that general access structures cannot be realized. This paper shows by providing the trustees with several information data concerning distributed method, any structure can update change and relation to graph are also discussed.
Abstract A connected graph G is called t ‐tough if · w(G ‐ S) ⩽ |S| for any subset S of V(G) with > 1, where ) the number components S. We prove that every k has a ‐factor k|G| even and |G| ⩾ + 1. This result, first conjectured by Chvátal, sharp in following sense: For positive integer real ε, there exists (k ε)‐tough 1 which no ‐factor.
Abstract Given a graph , the ‐colored Gallai‐Ramsey number is defined to be minimum integer such that every ‐coloring (using all colors) of complete on vertices contains either rainbow triangle or monochromatic copy . Recently, Fox et al [J. Combin. Theory Ser. B, 111 (2015), pp. 75–125] conjectured value numbers for graphs. We verify this conjecture first open case, where
The accumulation of monocyte-derived macrophages in the lung tissue during inflammation is important for pathogenesis fibrotic disease. Deficiencies chemokine receptors CCR2 and CCR5 their ligands, which mediate monocyte/macrophage migration, ameliorate bleomycin (BLM)-induced fibrosis. Disulfiram (DSF), used to treat alcoholism because its aldehyde dehydrogenase (ALDH)-inhibiting effect, inhibits migration by inhibiting FROUNT, an intracellular regulator CCR2/CCR5 signalling. Here, we...
A subgraph $H$ of an edge-colored graph $G$ is rainbow if all the edges receive different colors. If does not contain a isomorphic to $H$, we say that $H$-free. For connected graphs $H_1$ and $H_2$, every $H_1$-free complete colored in sufficiently many colors $H_2$-free, write $H_1\le H_2$. The binary relation $\le$ reflexive transitive, hence it preorder. then trivially H_2$ holds. On other hand, there exists pair $(H_1, H_2)$ such proper supergraph $H_2$ Cui et al.~[Discrete...
Abstract Background Gastric tube prolapse into the thoracic cavity in retrosternal route reconstruction during esophagectomy is known as intrathoracic herniation of gastric (IHGT). However, few reports have determined whether a correlation exists between IHGT and postoperative complications. Moreover, optimal procedure for avoiding remains unclear. Methods This retrospective study included 200 patients who had undergone subtotal at single institution. The diagnosis was defined length ≥ 5 cm...
Esophageal neuroendocrine carcinoma (E-NEC) is a rare malignancy. Although treatment for E-NEC involves combination of surgery, chemotherapy, radiotherapy, and immunotherapy, prognosis poor the strategy remains unclear. Surgery after neoadjuvant chemotherapy standard advanced esophageal squamous cell carcinoma; however, limited reports exist on its application E-NEC. This study aimed to examine surgical outcomes patients with based pathological findings endoscopic biopsies before surgery...
Abstract Given r ⩾ 3 and 1 ⩽ λ , we determine all values of k for which every ‐regular graph with edge‐connectivity has a ‐factor.
Abstract For a graph G, p ( G ) denotes the order of longest path in and c cycle. We show that if is connected n ≥ 3 vertices such d u + v w ≧ for all triples u, v, independent vertices, then satisfies – 1, or one six families exceptional graphs. This generalizes results Bondy Bauer, Morgana, Schmeichel, Veldman. © 1995, John Wiley & Sons, Inc.
In this article, we study cycle coverings and 2-factors of a claw-free graph those its closure, which has been defined by the first author (On closure concept in graphs, J Combin Theory Ser B 70 (1997), 217–224). For G cl(G), prove: (1) V(G) is covered k cycles if only V(cl(G)) cl(G); (2) 2-factor with at most components cl(G) components. © 1999 John Wiley & Sons, Inc. Graph 32: 109–117,
Abstract For a positive integer k , graph G is k‐ordered hamiltonian if for every ordered sequence of vertices there cycle that encounters the in given order. It shown order n with 3 ≤ /2, and deg( u ) + v ≥ (3 − 9)/2 pair u, nonadjacent then ‐ordered hamiltonian. Minimum degree conditions are also hamiltonicity. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 199–210,
Abstract An edge e of a 3‐connected graph G is said to be removable if ‐ subdivision graph. If not removable, then nonremovable. In this paper, we study the distribution edges in graphs and prove that order n ≥ 5 has at most [(4 — 5)/3] nonremovable edges.
The well-known Chvátal--Erdös theorem states that every graph $G$ of order at least three with $\alpha(G)\le\kappa(G)$ has a Hamiltonian cycle, where $\alpha(G)$ and $\kappa(G)$ are the independence number connectivity $G$, respectively. Oberly Sumner [J. Graph Theory, 3 (1979), pp. 351--356] have proved connected, locally connected claw-free cycle. We study connection these two theorems. For $x\in V(G)$, let $B(x)$ denote subgraph induced by closed neighborhood $x$. Then says satisfying...