Results 131 to 140 of about 252,358 (178)

Microbial communities on dry natural rocks are richer and less stressed than those on man-made playgrounds. [PDF]

open access: yesMicrobiol Spectr
Manninen J   +4 more
europepmc   +1 more source

Change in the chondroitin/dermatan structure in distal lung tissue from COPD patients. [PDF]

open access: yesSci Rep
Alsafadi HN   +10 more
europepmc   +1 more source

Explainable artificial intelligence identifies and localizes left ventricular scar in hypertrophic cardiomyopathy using 12-Lead electrocardiogram. [PDF]

open access: yesSci Rep
Nezamabadi K   +10 more
europepmc   +1 more source

2-Edge connected dominating sets and 2-Connected dominating sets of a graph

Journal of Combinatorial Optimization, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Hengzhe   +2 more
openaire   +1 more source

OUTER-CONNECTED 2-DOMINATING SETS OF GRAPHS

Advances and Applications in Discrete Mathematics, 2019
Summary: Let \(G=(V(G), E(G))\) be a simple graph. A subset \(S\) of \(V(G)\) is an outer-connected 2-dominating set of \(G\) if \(S\) is a 2-dominating set of \(G\) and the graph \(\langle V(G)\backslash S\rangle\) is connected. The outer-connected 2-domination number of \(G\), denoted by \(\gamma^c_2(G)\), is the smallest cardinality of an outer ...
Canoy, Sergio R. jun.   +1 more
openaire   +1 more source

CONNECTED dr-POWER DOMINATING SETS IN GRAPHS

Advances and Applications in Discrete Mathematics, 2018
Summary: Let \(G\) be a simple graph. A set \(P\subseteq V(G)\) is called a connected \(dr\)-power dominating set of \(G\) if it is a \(dr\)-power dominating set and the induced subgraph of \(P\), denoted by \(\langle P\rangle\), is connected. The minimum cardinality of a connected \(dr\)-power dominating set \(P\) of a graph \(G\), denoted by \(\gamma^
Cabahug, Isagani S. jun.   +1 more
openaire   +2 more sources

Connected dominating sets and connected domination polynomials of square of centipedes

Journal of Information and Optimization Sciences, 2016
AbstractLet G be a simple connected graph. The connected domination polynomial of G is defined by , where γd(G) is the connected domination number of G. In this paper, we find the connected dominating sets of and a recursive formula is obtained. Also, we construct the connected domination polynomial of and some interesting properties between the ...
A. Vijayan, M. Felix Nes Mabel
openaire   +1 more source

Home - About - Disclaimer - Privacy