Nathan B. Shank

MaRDI QIDQ1953520zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Proportional component order network connectivity CONTACT. Communications on Number Theory and Combinatorial Theory	2025-03-07	Paper
Extremal problems related to the cardinality-redundance of graphs Congressus Numerantium	2025-01-08	Paper
scientific article; zbMATH DE number 7824069 (Why is no real title available?) (available as arXiv preprint)	2024-03-26	Paper
scientific article; zbMATH DE number 7824069 (Why is no real title available?)	2024-03-26	Paper
Extremal problems related to the cardinality-redundance of graphs	2023-11-29	Paper
Extremal problems related to the cardinality-redundance of graphs (available as arXiv preprint)	2023-11-29	Paper
On the n-attack Roman Dominating Number of a Graph	2023-05-25	Paper
Graph Coloring as a Measure of Network Vulnerability	2022-12-02	Paper
Generalized Bondage Number: The k-synchronous bondage number of a graph	2022-08-15	Paper
Vertex and Mixed k-Diameter Component Connectivity	2021-11-07	Paper
On proportional network connectivity	2021-06-30	Paper
Partisan Combinatorial Game of Edge and Vertex Removal on Graphs	2021-01-05	Paper
The \(k\)-diameter component edge connectivity parameter Involve	2018-05-04	Paper
Component order edge connectivity for graphs of fixed size and order.	2015-10-27	Paper
Coupon collector problem for non-uniform coupons and random quotas The Electronic Journal of Combinatorics	2013-06-07	Paper
scientific article; zbMATH DE number 5717187 (Why is no real title available?)	2010-06-07	Paper
Nearest-neighbor graphs on the cantor set Advances in Applied Probability	2009-05-06	Paper

Research outcomes over time

This page was built for person: Nathan B. Shank