Results 321 to 330 of about 7,293,468 (349)
Some of the next articles are maybe not open access.
2004
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that graphs generated this way have fairly large dominating sets (i.e. linear in the size of the graph).
Cooper, C, Klasing, R, Zito, M
openaire +3 more sources
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that graphs generated this way have fairly large dominating sets (i.e. linear in the size of the graph).
Cooper, C, Klasing, R, Zito, M
openaire +3 more sources
Journal of Discrete Mathematical Sciences and Cryptography, 2009
Abstract Let G = (V, E) be a simple graph. A set S ⊆ V is a dominating set of G, if every vertex in V − S is adjacent to at least one vertex in S. Let be the family of all dominating sets of a graph G with cardinality i, and G* be the graph obtained by appending a single pendant edge to each vertex of graph G.
Yee-Hock Peng, Saeid Alikhani
openaire +2 more sources
Abstract Let G = (V, E) be a simple graph. A set S ⊆ V is a dominating set of G, if every vertex in V − S is adjacent to at least one vertex in S. Let be the family of all dominating sets of a graph G with cardinality i, and G* be the graph obtained by appending a single pendant edge to each vertex of graph G.
Yee-Hock Peng, Saeid Alikhani
openaire +2 more sources
Constrained dominant sets for retrieval
2016 23rd International Conference on Pattern Recognition (ICPR), 2016Learning new global relations based on an initial affinity of the database objects has shown significant improvements in similarity retrievals. Locally constrained diffusion process is one of the recent effective tools in learning the intrinsic manifold structure of a given data.
MEQUANINT, EYASU ZEMENE +2 more
openaire +2 more sources
Chapter 6 Contagion and Dominating Sets
2006Abstract Each agent of a finite population interacts strategically with each of his neighbours on a graph. All agents have the same pair of available actions. In every period, each agent chooses a particular action if at least a proportion p of his neighbours has chosen this action in the previous period.
Durieu, Jacques +2 more
openaire +3 more sources
SIAM Journal on Discrete Mathematics, 1993
Let \(G=(V,E)\) be a finite graph. The cardinality of \(V\) (the set of vertices) is \(n\) and the cardinality of \(E\) (the set of edges) is \(m\). Define the following relation of \(E\): \(e\succeq e'\) iff either \(e=e'\) or \(e\) and \(e'\) are adjacent. A subset \(D\subseteq E\) is called an edge dominating set if for each \(e'\in E\) there is \(e\
J. D. Horton, K. Kilakos
openaire +3 more sources
Let \(G=(V,E)\) be a finite graph. The cardinality of \(V\) (the set of vertices) is \(n\) and the cardinality of \(E\) (the set of edges) is \(m\). Define the following relation of \(E\): \(e\succeq e'\) iff either \(e=e'\) or \(e\) and \(e'\) are adjacent. A subset \(D\subseteq E\) is called an edge dominating set if for each \(e'\in E\) there is \(e\
J. D. Horton, K. Kilakos
openaire +3 more sources
Dominating Sets and Eigenvalues of Graphs
Bulletin of the London Mathematical Society, 1994Let \(G\) be a graph with vertices \(1,2,\dots,n\) and \((0,1)\)-adjacency matrix \(A\). Suppose that \(A\) has spectral decomposition \(A= \mu_ 1 P_ 1+ \mu_ 2 P_ 2+\cdots+ \mu_ m P_ m\) and let \(\{{\mathbf e}_ 1,{\mathbf e}_ 2,\dots,{\mathbf e}_ n\}\) be the standard orthonormal basis of \(\mathbb{R}^ n\). A star partition of the vertices of \(G\) is
openaire +2 more sources
VERY EXCELLENT DOMINATING WEAKLY CONNECTED SET DOMINATING SETS [PDF]
Advances in Mathematics: Scientific Journal, 2020 M. Davamani Christober +1 more
openaire +1 more source
Minimum connected dominating set based RSU allocation for smartCloud vehicles in VANET
Cluster Computing, 2018A. Chinnasamy +3 more
semanticscholar +1 more source
A Clustering Scheme for Wireless Sensor Networks Based on Genetic Algorithm and Dominating Set
, 2018Jeng‐Shyang Pan +4 more
semanticscholar +1 more source
Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set
International Symposium on Distributed Computing, 2018M. Ghaffari, F. Kuhn
semanticscholar +1 more source