Pages that link to "Item:Q2451704"

The following pages link to Controllability of undirected graphs (Q2451704):

Displaying 20 items.

• On strongly asymmetric and controllable primitive graphs (Q335330) (← links)
• Using permuted graph bases in \(\mathcal{H}_\infty\) control (Q522828) (← links)
• Constructing a controllable graph under edge constraints (Q1680674) (← links)
• Linear control of live marked graphs (Q1868050) (← links)
• The impact of graph symmetry on the number of driver nodes in complex networks (Q2027437) (← links)
• The controllability Gramian of lattice graphs (Q2174028) (← links)
• Laplacian controllability for graphs with integral Laplacian spectrum (Q2222890) (← links)
• Laplacian controllability classes for threshold graphs (Q2261563) (← links)
• Almost equitable partitions and new necessary conditions for network controllability (Q2407159) (← links)
• On a Conjecture of Godsil Concerning Controllable Random Graphs (Q2953321) (← links)
• Controllability and matchings in random bipartite graphs (Q3179073) (← links)
• Control of Some Graph Invariants in Dynamic Routing (Q3627672) (← links)
• (Q4400814) (← links)
• On the construction of Q-controllable graphs (Q4594688) (← links)
• Controlling consensus in networks with symmetries (Q5056535) (← links)
• Controllability of NEPSes of graphs (Q5084721) (← links)
• Minimal Laplacian controllability problems of threshold graphs (Q5221130) (← links)
• Further results on almost controllable graphs (Q6051129) (← links)
• Strong star complements in graphs (Q6124250) (← links)
• The Smith normal form of the walk matrix of the Dynkin graph \(D_n\) for \(n \equiv 0 \pmod{4}\) (Q6155676) (← links)