Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/strong-kernel-number-in-certain-oriented-cycle-extension-of-graphs-AeO0Kbsw6F
References (9)
-
J.-J. Wang, C.-N. Hung, J.J.M. Tan, L.-H. Hsu, T.-Y. Sung (2000)
Construction schemes for fault-tolerant Hamiltonian graphsNetworks., 35
-
J. Von Neumann, O. Morgenstern (1944)
Theory of games and economic behaviour -
C. Berge (1985)
Graphs, volume 6 -
A.S. Fraenkel (1981)
Planar kernel and Grundy with d ≤ 3, d + ≤ 2, d − ≤ 2 are NP-completeDiscrete. Appl. Math., 3
-
J.-M. Le Bars (2000)
Counterexample of the 0–1 Law for fragments of existential second-order logic: an overviewBull. Symb. Logic., 6
-
S. Armugam, S. Velammal (1992)
Maximum size of a connected graph with given domination parametersARS Combinatoria., 52
-
C. Berge, P. Duchet (1990)
Recent problems and results about kernels in directed graphsDiscrete. Math., 86
-
J. Wu (2002)
Extended dominating-set-based routing in Ad Hoc wireless networks with Unidirectional LinksIEEE. Trans. Parallel. Distrib. Syst., 13
-
P. Manuel, I. Rajasingh, B. Rajan, J. Punitha (2008)
Kernel in Petersen GraphsJ. Comb. Inform. Syst. Sci., 33
- Publisher
- Springer Journals
- Copyright
- Copyright © 2015 by Springer Basel
- Subject
- Mathematics; Mathematics, general; Computer Science, general
- ISSN
- 1661-8270
- eISSN
- 1661-8289
- DOI
- 10.1007/s11786-015-0225-1
- Publisher site
- See Article on Publisher Site
Abstract
A kernel in a directed graph D(V, E) is a set S of vertices of D such that no two vertices in S are adjacent and for every vertex u in V\S there is a vertex v in S, such that (u, v) is an arc of D. The problem of existence of a kernel is itself an NP-complete for a general digraph. But in this paper we solve the strong kernel problem for certain oriented Cycle Extension of graphs namely Circular Ladder and Petersen Graphs.
Journal
Mathematics in Computer Science – Springer Journals
Published: May 7, 2015