Circulant Digraphs with Larger Linear Guessing Number and Smaller Degree
The guessing number of a digraph is a new invariant in graph theory raised by S. Riis in 2006 and based on its applications in network coding and boolean circuit complexity theory. In this paper, we present the lower and upper bounds on a guessing number and linear guessing number of circulant digra...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-06-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/13/2129 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|