A5004892722- Graph theory and applications
- Advanced Graph Theory Research
- Limits and Structures in Graph Theory
- Interconnection Networks and Systems
- graph theory and CDMA systems
- Advanced Combinatorial Mathematics
- Geometric and Algebraic Topology
- semigroups and automata theory
- Finite Group Theory Research
- Advanced Frequency and Time Standards
- Graph Labeling and Dimension Problems
- Computational Geometry and Mesh Generation
- Advancements in PLL and VCO Technologies
- Coding theory and cryptography
- Nanocluster Synthesis and Applications
- Homotopy and Cohomology in Algebraic Topology
- Reliability and Maintenance Optimization
- Free Radicals and Antioxidants
- Service-Oriented Architecture and Web Services
- Mathematics and Applications
- Energy Efficient Wireless Sensor Networks
- Software System Performance and Reliability
- Advanced Graph Neural Networks
- Matrix Theory and Algorithms
- Advanced biosensing and bioanalysis techniques
Sichuan Normal University
2015-2024
Beijing Institute of Radio Metrology and Measurement
2024
Xiamen University
2013-2021
CAS Key Laboratory of Urban Pollutant Conversion
2015
Soochow University
2009
Northeastern University
2009
Let be a graph with minimum degree . The spectral radius of , denoted by is the largest eigenvalue adjacency matrix In this note, we mainly prove following two results.(1) on vertices If then contains Hamilton path unless .(2) cycle As corollaries our first result, previous theorems due to Fiedler and Nikiforov Lu et al. are obtained, respectively. Our second result refines another theorem Nikiforov.
Abstract In this article, we extend Moon's classic formula for counting spanning trees in complete graphs containing a fixed forest to bipartite graphs. Let be the bipartition of graph with and . We prove that any given components , number which contain all edges is equal where
In this paper, we first present spectral conditions for the existence of $C_{n-1}$ in graphs (2-connected graphs) order $n$, which are motivated by a conjecture Erd\H{o}s. Then prove Hamilton cycles balanced bipartite graphs. This result presents analog Moon-Moser's theorem on graphs, and extends previous due to Li second author $n$ sufficiently large. We conclude paper with two problems tight long given lengths.
For any link and for modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings (an m-coloring has values in Z/mZ). Given a diagram link, class is formed by each assignment colors to arcs that obtained from former coloring permutation which preserves condition at crossing. This requirement implies topological invariance classes. We show prime number classes depends rank matrix (with respect this modulus).
In this paper, we discuss some possible deployment patterns of wireless sensors to achieve both coverage and connectivity which were ignored in the discussion "Deploying Wireless Sensors To Achieve Both Coverage And Connectivity, ACM, MobiHoc, 2006", prove that strip-based are absolutely optimal among all 1-or 2-connectivity.
This paper gives a test method of BeiDou timing receiver delay. A System simulator and time interval counter were used in the experiments. During process, most important step is to calibrate delay simulator. The uncertainty this analyzed be less than 1.5ns. Using method, some typical Chinese commercial receivers tested, results are shown figures. variations with temperature have been studied.
In this paper we first investigate minimal sufficient sets of colors for p=11 and 13. For odd prime p any p-colorable link L with non-zero determinant, give alternative proofs mincol_p \geq 5 11 6 17. We elaborate on equivalence classes distinct (on a given modulus) prove that there are two such five modulo 11, only one class Finally, positive answer to question raised by Nakamura, Nakanishi, Satoh concerning an inequality involving crossing numbers. show it is equality the trefoil...
Abstract The problem of counting spanning trees graphs or networks is a fundamental and crucial area research in combinatorics, while has numerous important applications statistical physics, network theory theoretical computer science. Very recently, Kosar, Zaman, Ali Ullah obtained nice formula on the number K 5 -chain l constructed by connecting copys complete . They made extensive use matrix spectral graph theory, especially normalized Laplacian graphs. In this paper, using rather simple...
Release engineering has traditionally focused on continuously delivering features and bug fixes to users, but at a certain scale, it becomes impossible for release team determine what should be released. At Meta's the responsibility appropriately necessarily falls back engineer writing reviewing code. To address this challenge, we developed models of diff risk scores (DRS) how likely is cause SEV, i.e., severe fault that impacts end-users. Assuming SEVs are only caused by diffs, naive model...
With the development of BeiDou(BD) Navigation Satellite system, BD can be another choice for remote precise time and frequency transfer. A strict common view test using System is carried out in this paper. Since there are GEO, IGSO MEO satellites based on discussed paper separately. Finally, we give a different weight to each satellite according its elevation, get weighted-average common-view result which better than 5 ns.
Let $D$ be a reduced alternating diagram of non-split link $L$ and $\tilde{L}$ the whose is obtained from by crossing change. If alternating, then $c(\tilde{L})\leq c(L)-2$. In this paper we explore when $c(\tilde{L})=c(L)-2$ holds obtain simple sufficient necessary condition in terms plane graphs corresponding to $L$. This result via analyzing behavior Tutte polynomial signed graph $\tilde{L}$.
In this paper, an expression for the Homfly polynomial of a classical pretzel link with fixed orientation was obtained. As application, we proved that (p, q, r)-pretzel knot is achiral if and only {p, r} = {2, 1, 1}, {-2, -1, -1}, 3}, -3}, {1, k}, k, -2 -k} or {-1, -k, 2 + where k odd integer.