Abstract: The k-core of a graph is the maximal subgraph with minimum vertex degree k. When the core with the largest k is found, it can be removed and the next core can be found. In each of these ...
Graphene, which is comprised of a single layer of carbon atoms arranged in a hexagonal lattice, is a widely used material ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback