REVIEW 2 cited by
Extremality of graph entropy based on Laplacian degrees of k-uniform hypergraphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple graphs are extended to k-uniform hypergraphs. Using an edge-moving operation, the maximum and minimum graph entropy based on Laplacian degrees are determined in k-uniform hypertrees, unicyclic k-uniform hypergraphs, bicyclic k-uniform hypergraphs and k-uniform chemical hypertrees, respectively, and the corresponding extremal graphs are determined.
Forward citations
Cited by 2 Pith papers
-
DRRNet: Macro-Micro Feature Fusion and Dual Reverse Refinement for Camouflaged Object Detection
DRRNet is a four-stage camouflaged object detection network that fuses global and local features and then applies two rounds of reverse refinement to sharpen object boundaries.
-
3DPyranet Features Fusion for Spatio-temporal Feature Learning
A low-parameter, biologically inspired 3D pyramidal network with a linear-SVM feature-fusion extension matches or exceeds several prior video-classification baselines on Weizmann, KTH, YUPENN, and Maryland datasets.
Discussion (0). Continue with ORCID to comment.