The following pages link to (Q3127081):
Displaying 19 items.
- Algebraic connectivity and degree sequences of trees (Q959888) (← links)
- Missing edge coverings of bipartite graphs and the geometry of the Hausdorff metric (Q1956321) (← links)
- Center and its spectrum of almost all \(n\)-vertex graphs of given diameter (Q2033352) (← links)
- Classification of graphs of diameter 2 (Q2182228) (← links)
- Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs (Q2258883) (← links)
- On radius and typical properties of \(n\)-vertex graphs of given diameter (Q2662844) (← links)
- Periodic and weakly periodic ground states for the Potts model with competing interactions on the Cayley tree (Q2959178) (← links)
- (Q3313666) (← links)
- (Q4966484) (← links)
- The set of all values of the domination number in trees with a given degree sequence (Q5090145) (← links)
- NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs (Q5090153) (← links)
- On the König graphs for a 5-path and its spanning supergraphs (Q5090154) (← links)
- A weighted perfect matching with constraints on weights of its parts (Q5100129) (← links)
- A Computable Structure with Non-Standard Computability (Q5230801) (← links)
- Asymptotic approximation for the number of n-vertex graphs of given diameter (Q5373998) (← links)
- A formula for the weight of a minimal filling of a finite metric space (Q5396964) (← links)
- New cases of polynomial solvability of the independent set problem for graphs with forbidden triods (Q6078549) (← links)
- A combinatorial invariant of gradient-like flows on a connected sum of $\mathbb{S}^{n-1}\times\mathbb{S}^1$ (Q6188994) (← links)
- Hypergraph edge representations with the use of homological paths (Q6644071) (← links)
