Dominating properties of star complements

MaRDI QIDQ2724044zbMATH OpenFDO

Authors Bolian Liu, P. Rowlinson

Publication date 8 July 2001

Published in Publications de l'Institut Mathématique. Nouvelle Série (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/121193

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

dominating setgraph eigenvaluesstar complement

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

Let \(\mu\) be an eigenvalue of multiplicity \(m\) of a graph \(G\) and let \(X\) be a set of \(m\) vertices of \(G\). The subgraph \(G-X\) is called a star complement of \(G\) for the eigenvalue \(\mu\) if \(\mu\) is not an eigenvalue of \(G-X\). If \(\mu \neq 0\), vertices of a star complement form a dominating set in \(G\). The authors study related dominating properties, in particular, in the context of memoryless communication networks.

Recommendations

• scientific article; zbMATH DE number 1746416
• Dominating Sets and Eigenvalues of Graphs
• On independent star sets in finite graphs
• On the characterization of graphs by star complements
• On graphs with prescribed star complements

Cited in

(2)

• Dominating Sets and Eigenvalues of Graphs
• scientific article; zbMATH DE number 1746416 (Why is no real title available?)

This page was built for publication: Dominating properties of star complements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724044)