3008 search results - page 156 / 602 » Independence in connected graphs |
189
click to vote
EJC
2008
15 years 6 months ago
2008
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
163
click to vote
TCS
2010
15 years 4 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
215
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
170
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
189
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...