Results 251 to 260 of about 2,253,480 (276)
Some of the next articles are maybe not open access.
SUPERLATIVE TOTAL DOMINATION IN GRAPHS
Electronic Journal of Mathematical Analysis and ApplicationsSummary: Let \(G= (V, E)\) be a simple graph with no isolated vertices and \(p \geq 3\). A set \(D \subseteq V\) is a dominating set, abbreviated as DS, of a graph \(G\), if every vertex in \(V-D\) is adjacent to some vertex in \(D\), while a total dominating set, abbreviated as TDS, of \(G\) is a set \(T \subseteq V\) such that every vertex in \(G ...
Bankapur, Veena, Chaluvaraju, B.
openaire +1 more source
Integrity of quasi-total graphs
2019Summary: A communication network can be considered to be highly vulnerable to disruption if the failure of few members can result in no member's being able to communicate with very many others. This idea suggests the concept of the integrity of a graph.
Cangül, İsmail Naci +2 more
openaire +3 more sources
Cancer statistics for the US Hispanic/Latino population, 2021
Ca-A Cancer Journal for Clinicians, 2021Kimberly D Miller +2 more
exaly
Total coloring of middle graph, total graph of twig graph and comb graph
Journal of Xidian University, 2020openaire +1 more source
Total domination edge critical graphs
1998A subset \(D\) of the vertex set \(V(G)\) of a graph \(G\) is called total dominating in \(G\), if for each \(x\in V(G)\) there exists a vertex \(y\in D\) adjacent to \(x\). The minimum number of vertices of a total dominating set in \(G\) is the total domination number \(\gamma_t(G)\) of \(G\).
Van Der Merwe, L. C. +2 more
openaire +1 more source
TOTAL COLORING OF CERTAIN GRAPHS
Advances and Applications in Discrete Mathematics, 2021Muthuramakrishnan, D., Jayaraman, G.
openaire +1 more source
Structure of Regular Total Graphs†
Journal of the London Mathematical Society, 1969Behzad, M., Radjavi, H.
openaire +2 more sources