Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Kathryn Fraughnaugh"'
Publikováno v:
Electronic Notes in Discrete Mathematics. 11:751-759
Let γ (G) be the domination number of a graph G. We show that if G has maximum degree at most 3 and girth at least 5, then γ(G) ≤ 1 7 (4n − e + p + 3i) where G has n nodes, e edges, p pendant nodes, and i isolated nodes. It follows that if G is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e55dc0c1d4d57f2772558fd1b3b2e7a5
https://doi.org/10.1016/s1571-0653(04)00119-2
https://doi.org/10.1016/s1571-0653(04)00119-2
Publikováno v:
Annals of Operations Research. 78:189-200
The classification problem is to determine the class of an object when it is costly to observe the values of its attributes. This type of problem arises in fault diagnosis, in the desig- of interactive expert systems, in reliability analysis of coher
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc3f71b1feca8746d30f0a3f1f2ddf54
https://doi.org/10.1023/a:1018997900011
https://doi.org/10.1023/a:1018997900011
Publikováno v:
Journal of Combinatorial Theory, Series B. 71(1):73-78
LetGbe a graph withnnodes,eedges, chromatic numberχ, and girthg. In an acyclic orientation ofG, an arc isdependentif its reversal creates a cycle. It is well known that ifχ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42a5081711d307df945c593f3a02bf84
Autor:
Kathryn Fraughnaugh, Stephen C. Locke
Publikováno v:
SIAM Journal on Discrete Mathematics. 9:674-681
Finding a maximum independent set in a graph is well known to be an $NP$-complete problem. Here an $O(n^2)$-time algorithm that finds an independent set of order at least $(6n-m)/13$ in a triangle-free graph with $n$ vertices and $m$ edges is present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e98ab64198f259843d849040f731dfc
https://doi.org/10.1137/s0895480194266434
https://doi.org/10.1137/s0895480194266434
Publikováno v:
Discrete Mathematics. 138:93-99
A triangle-free graph is maximal if the addition of any edge creates a triangle. For n ⩾ 5, we show there is an n -node m -edge maximal triangle-free graph if and only if it is complete bipartite or 2 n − 5 ⩽ m ⩽⌊( n − 1) 2 /4⌋ + 1. A d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3dbcd2324a19e4662ba841b2c71e6ca0
https://doi.org/10.1016/0012-365x(94)00190-t
https://doi.org/10.1016/0012-365x(94)00190-t
Publikováno v:
Annals of Operations Research. 41:299-312
We describe an implementation of tabu search that solves the path assignment problem, which is the problem of routing video data through an undercapacitated telecommunications network. Two versions of the tabu search were studied. Our results compare
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6a953f3bf71ba57908c18c3e5013da3
https://doi.org/10.1007/bf02022997
https://doi.org/10.1007/bf02022997
Autor:
Kathryn Fraughnaugh
Publikováno v:
Networks. 30:73-73
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84d05a156f1c4e8135082d48613c6e0a
https://doi.org/10.1002/(sici)1097-0037(199708)30:1<73::aid-net8>3.0.co
https://doi.org/10.1002/(sici)1097-0037(199708)30:1<73::aid-net8>3.0.co
Autor:
Jones, Kathryn Fraughnaugh
Publikováno v:
Journal of Graph Theory; 1990, Vol. 14 Issue 5, p525-535, 11p
Autor:
Karen Casey, Kathryn Fraughnaugh
Publikováno v:
Linear Algebra and its Applications. :53-66
The conditional chromatic numberx(G, P) of a graph G with respect to a graphical property P is the minimum number of colors needed to color the nodes of G such that each color class induces a subgraph of G with property P. The conditional chromatic n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cec896d0f46b957c669735e1328ddefe
Autor:
Jones, Kathryn Fraughnaugh
Publikováno v:
In Journal of Combinatorial Theory, Series B 1984 37(3):254-269