635 citations
- Texas A&M UniversityUS6 papers
- University of Wisconsin–OshkoshUS6 papers
- Universidad Nacional Autónoma de MéxicoMX4 papers
- Centro de Investigación y de Estudios Avanzados del Instituto Politécnico NacionalMX3 papers
- Universidad de CádizES2 papers
- Yantai UniversityCN2 papers
- Benemérita Universidad Autónoma de PueblaMX1 paper
- Centro Universitário InternacionalMX1 paper
- Middle Tennessee State UniversityUS1 paper
- Monash UniversityAU1 paper
- Naval Postgraduate SchoolUS1 paper
- NED University of Engineering and TechnologyPK1 paper
5 papers · 1 filter
On Domination Number and Distance in Graphs
Cong X. Kang
A vertex set of a graph is a \emph{dominating set} if each vertex of either belongs to or is adjacent to a vertex in . The \emph{domination number} of …
A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs
Linda Eroh, Cong X. Kang, Eunjeong Yi
The \emph{metric dimension} of a graph is the minimum number of vertices such that every vertex of is uniquely determined by its vector of distances to the chosen…
Resistance distance-based graph invariants of subdivisions and triangulations of graphs
Yujun Yang, Douglas J. Klein
We study three resistance distance-based graph invariants: the Kirchhoff index, and two modifications, namely, the multiplicative degree-Kirchhoff index and the additive degree-Kir…
On Zero Forcing Number of Graphs and Their Complements
Linda Eroh, Cong X. Kang, Eunjeong Yi
The \emph{zero forcing number}, , of a graph is the minimum cardinality of a set of black vertices (whereas vertices in are colored white) such tha…
A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs
Cong X. Kang, Eunjeong Yi
The \emph{zero forcing number}, , of a graph is the minimum cardinality of a set of black vertices (whereas vertices in are colored white) such that i…