Pages that link to "Item:Q1942669"

The following pages link to Efficient domination in circulant graphs (Q1942669):

Displaying 38 items.

• Efficient domination through eigenvalues (Q317399) (← links)
• Total perfect codes in Cayley graphs (Q329192) (← links)
• DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph (Q391194) (← links)
• Tight-optimal circulants vis-à-vis twisted tori (Q401131) (← links)
• Efficient dominating sets in circulant graphs with domination number prime (Q402369) (← links)
• Efficient domination in cubic vertex-transitive graphs (Q449200) (← links)
• Efficient total domination in digraphs (Q450576) (← links)
• Efficient dominating sets in circulant graphs (Q526230) (← links)
• Perfect codes in circulant graphs (Q526235) (← links)
• The game of Cops and Robber on circulant graphs (Q528556) (← links)
• Efficient domination in circulant graphs with two chord lengths (Q846022) (← links)
• Efficient edge domination in regular graphs (Q1005253) (← links)
• Cyclotomic graphs and perfect codes (Q1621577) (← links)
• On efficiently total dominatable digraphs (Q1714019) (← links)
• Constructing dominating sets in circulant graphs (Q1745909) (← links)
• Efficient absorbants in generalized de Bruijn digraphs (Q1751232) (← links)
• On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
• Independent perfect domination sets in semi-Cayley graphs (Q2039694) (← links)
• Domination ratio of a family of integer distance digraphs with arbitrary degree (Q2142680) (← links)
• Efficient domination in Cayley graphs of generalized dihedral groups (Q2151216) (← links)
• Classification of efficient dominating sets of circulant graphs of degree 5 (Q2157841) (← links)
• Efficient \(k\)-distance dominating set in Cayley graphs (Q2212689) (← links)
• Existence of efficient total dominating sets of circulant graphs of degree 4 (Q2286605) (← links)
• Characterization of subgroup perfect codes in Cayley graphs (Q2305927) (← links)
• Domination in Cayley graphs: a survey (Q2329914) (← links)
• Efficient domination in knights graphs (Q2370394) (← links)
• Domination ratio of integer distance digraphs (Q2416423) (← links)
• Parameterized domination in circle graphs (Q2441539) (← links)
• Independent perfect dominating sets in semi-Cayley graphs (Q2661763) (← links)
• (Q3011738) (← links)
• (Q3413877) (← links)
• Perfect Codes in Cayley Graphs (Q4604646) (← links)
• On efficient absorbant conjecture in generalized De Bruijn digraphs (Q4976295) (← links)
• Subgroup Perfect Codes in Cayley Graphs (Q5128515) (← links)
• Parameterized Domination in Circle Graphs (Q5200517) (← links)
• Stable dominating circuits in snarks (Q5936035) (← links)
• The (non-)existence of perfect codes in Fibonacci cubes (Q5964828) (← links)
• On regular sets in Cayley graphs (Q6491172) (← links)