Spectral invariant learning for dynamic graphs under distribution shifts
Abstract
Supplementary Material
- Download
- 329.40 KB
References
Recommendations
The signless Laplacian spectral radius of bicyclic graphs with prescribed degree sequences
In this paper, we characterize all extremal connected bicyclic graphs with the largest signless Laplacian spectral radius in the set of all connected bicyclic graphs with prescribed degree sequences. Moreover, the signless Laplacian majorization theorem ...
Dynamic chromatic number of regular graphs
A k-dynamic coloring of a graph G is a proper coloring of G with k colors such that for every vertex v@?V(G) of degree at least 2, the neighbors of v receive at least 2 colors. The dynamic chromatic number of a graph G, @g"2(G), is the least number k ...
On r -dynamic coloring of graphs
An r -dynamic proper k -coloring of a graph G is a proper k -coloring of G such that every vertex in V ( G ) has neighbors in at least min { d ( v ) , r } different color classes. The r -dynamic chromatic number of a graph G , written r ( G ) , is the ...
Comments
Information & Contributors
Information
Published In
Publisher
Curran Associates Inc.
Red Hook, NY, United States
Publication History
Qualifiers
- Research-article
- Research
- Refereed limited
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0