A5077706287- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Game Theory and Voting Systems
- Complexity and Algorithms in Graphs
- Game Theory and Applications
- Graph theory and applications
- Limits and Structures in Graph Theory
- Auction Theory and Applications
- Interconnection Networks and Systems
- Matrix Theory and Algorithms
- Tensor decomposition and applications
- Facility Location and Emergency Management
- Optimization and Search Problems
- graph theory and CDMA systems
- Computational Geometry and Mesh Generation
- Advanced Optimization Algorithms Research
- Cooperative Communication and Network Coding
- Vehicle Routing Optimization Methods
- Finite Group Theory Research
- Business Strategy and Innovation
- Digital Platforms and Economics
- Logic, Reasoning, and Knowledge
- Supramolecular Self-Assembly in Materials
- Power System Optimization and Stability
- Coding theory and cryptography
Shanghai University
2016-2025
China Jiliang University
2018
Chongqing Normal University
2012
Hong Kong Polytechnic University
2006-2009
Trans-regional electricity trading is a meaningful way to optimize resource allocation and achieve carbon peak neutrality goals. In this paper, we construct the trans-regional cooperative game models considering impact of local microgrid integration. Based on theory with coalition graph structures, optimal mode cooperation different quota systems profits are studied. The obtained through reasonably distributed by profit distribution scheme based Owen value. theoretical numerical simulation...
The per capita Shapley support levels value is a generalization of the well-known to cooperative games with level structure. In this paper we propose new axiom, called invariance across games, which, together standard axioms efficiency, additivity, null player property, and joint productivity, characterizes value.This axiom requires that if has same position, is, refinement component containing at each behavior in different worth grand coalition as well structure, then payoff receives should...
Let G=(V,E) be a graph. A clique-transversal set D is subset of vertices G such that meets all cliques G, where clique defined as complete subgraph maximal under inclusion and having at least two vertices. The number, denoted by τC(G), the cardinality minimum in G. k-clique-coloring k-coloring its no monochromatic. All planar graphs have been proved to 3-clique-colorable Mohar Škrekovski [B. Mohar, R. Škrekovski, Grötzsch theorem for hypergraph cliques, Electron. J. Combin. 6 (1999) #R26]....
We study matching polynomials of uniform hypergraph and spectral radii supertrees. By comparing the supertrees, we extend Li Feng's results on grafting operations graphs to Using methods supertrees determine first $\lfloor\frac{d}{2}\rfloor+1$ largest $r$-uniform with size $m$ diameter $d$. In addition, two smallest are determined.