The following pages link to (Q3291034):
Displaying 50 items.
- The domination number and the least \(Q\)-eigenvalue (Q278336) (← links)
- Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247) (← links)
- Edge criticality in graph domination (Q295267) (← links)
- The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- Galois theory for clones and superclones (Q314226) (← links)
- Isolation in graphs (Q324891) (← links)
- Double Roman domination (Q335328) (← links)
- On the outer-connected domination in graphs (Q358644) (← links)
- Critical sets in bipartite graphs (Q368442) (← links)
- Normal extensions escape from the class of weighted shifts on directed trees (Q371795) (← links)
- Bounds on the \(k\)-dimension of products of special posets (Q382878) (← links)
- Rainbow edge-coloring and rainbow domination (Q383777) (← links)
- Domination versus independent domination in cubic graphs (Q385388) (← links)
- Trees as level sets for pseudoharmonic functions in the plane (Q399648) (← links)
- A note on 3-Steiner intervals and betweenness (Q409389) (← links)
- Minimal energies of trees with given parameters (Q417432) (← links)
- Graphs with constant sum of domination and inverse domination numbers (Q446329) (← links)
- Some upper bounds related with domination number (Q457547) (← links)
- Permanental bounds of the Laplacian matrix of trees with given domination number (Q497337) (← links)
- A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets (Q501004) (← links)
- Characterizing minimal point set dominating sets (Q504160) (← links)
- Partially normal composition operators relevant to weighted directed trees (Q511258) (← links)
- The \(k\)-rainbow reinforcement numbers in graphs (Q516871) (← links)
- Diameter bounded equal measure partitions of Ahlfors regular metric measure spaces (Q517455) (← links)
- Statistical physics of vaccination (Q521790) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Networks of common property resources (Q535168) (← links)
- Extremal energies of trees with a given domination number (Q550612) (← links)
- Bounds of Laplacian spectrum of graphs based on the domination number (Q556910) (← links)
- A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs (Q595678) (← links)
- Matroids and linking systems (Q599061) (← links)
- Matchings and transversals in hypergraphs, domination and independence in trees (Q599067) (← links)
- The complexity of embedding orders into small products of chains (Q603886) (← links)
- Graphs with disjoint dominating and paired-dominating sets (Q607427) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- Towards a new framework for domination (Q651449) (← links)
- Dominating and total dominating partitions in cubic graphs (Q657306) (← links)
- Domination number of graphs without small cycles (Q659744) (← links)
- Dominator colorings in some classes of graphs (Q659760) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- On extremal Zagreb indices of trees with given domination number (Q671118) (← links)
- On subgraphs in distance-regular graphs (Q685995) (← links)
- A note on graphs which have upper irredundance equal to independence (Q686250) (← links)
- Bounds relating generalized domination parameters (Q687110) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Lower bounds on the differential of a graph (Q713137) (← links)
- Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- The minimum genus of a two-point universal graph (Q755591) (← links)
