Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 6 / 6
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
A note on domination and independence-domination numbers of graphs
Martin Milanič, 2013, objavljeni znanstveni prispevek na konferenci

Opis: Vizing's conjecture is true for graphs ▫$G$▫ satisfying ▫$\gamma^i(G) = \gamma(G)$▫, where ▫$\gamma(G)$▫ is the domination number of a graph ▫$G$▫ and ▫$\gamma^i(G)$▫ is the independence-domination number of ▫$G$▫, that is, the maximum, over all independent sets ▫$I$▫ in ▫$G$▫, of the minimum number of vertices needed to dominate ▫$I$▫. The equality ▫$\gamma^i(G) = \gamma(G)$▫ is known to hold for all chordal graphs and for chordless cycles of length ▫$0 \pmod{3}$▫. We prove some results related to graphs for which the above equality holds. More specifically, we show that the problems of determining whether ▫$\gamma^i(G) = \gamma(G) = 2$▫ and of verifying whether ▫$\gamma^i(G) \ge 2$▫ are NP-complete, even if ▫$G$▫ is weakly chordal. We also initiate the study of the equality ▫$\gamma^i = \gamma$▫ in the context of hereditary graph classes and exhibit two infinite families of graphs for which ▫$\gamma^i < \gamma$▫.
Najdeno v: ključnih besedah
Povzetek najdenega: ...▫$\gamma^i = \gamma$▫ in the context of hereditary graph classes and exhibit two infinite families... ...Vizing's conjecture is true for graphs ▫$G$▫ satisfying ▫$\gamma^i(G) = \gamma(G)$▫, where ▫$\gamma(G)$▫... ...number, weakly chordal graph, NP-completeness, hereditary graph class, IDD-perfect graph...
Ključne besede: Vizing's conjecture, domination number, independence-domination number, weakly chordal graph, NP-completeness, hereditary graph class, IDD-perfect graph
Objavljeno: 15.10.2013; Ogledov: 1231; Prenosov: 62
URL Polno besedilo (0,00 KB)

2.
Linear separation of connected dominating sets in graphs
Martin Milanič, Nina Chiarelli, 2014, objavljeni znanstveni prispevek na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...Spernerjev hipergraf, pragovni hipergraf, connected dominating set, hereditary graph class, dually Sperner hypergraph, treshold hypergraph,...
Ključne besede: povezana dominantna množica, hereditarni grafovski razred, dualno Spernerjev hipergraf, pragovni hipergraf, connected dominating set, hereditary graph class, dually Sperner hypergraph, treshold hypergraph
Objavljeno: 15.10.2015; Ogledov: 1198; Prenosov: 42
URL Polno besedilo (0,00 KB)

3.
Graph classes with and without powers of bounded clique-width
Martin Milanič, Flavia Bonomo, Luciano Grippo, Martin Dario Safe, 2016, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...clique-width, power of a graph, hereditary graph class, power-bounded clique-width, ...
Ključne besede: clique-width, power of a graph, hereditary graph class, power-bounded clique-width
Objavljeno: 03.04.2017; Ogledov: 579; Prenosov: 80
URL Polno besedilo (0,00 KB)

4.
The price of connectivity for cycle transversals
Tatiana R. Hartinger, Matthew Johnson, Martin Milanič, Daniël Paulusma, 2015, objavljeni znanstveni prispevek na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...price of connectivity, hereditary graph class, path, cycle, transversal, ...
Ključne besede: price of connectivity, hereditary graph class, path, cycle, transversal
Objavljeno: 08.08.2016; Ogledov: 1329; Prenosov: 34
URL Polno besedilo (0,00 KB)

5.
The price of connectivity for cycle transversals
Tatiana R. Hartinger, Matthew Johnson, Martin Milanič, Daniël Paulusma, 2016, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...price of connectivity, hereditary graph class, path, cycle, transversal, ...
Ključne besede: price of connectivity, hereditary graph class, path, cycle, transversal
Objavljeno: 08.08.2016; Ogledov: 801; Prenosov: 29
URL Polno besedilo (0,00 KB)

6.
Minimal separators in graph classes defined by small forbidden induced subgraphs
Martin Milanič, Nevena Mitrović, 2019, objavljeni znanstveni prispevek na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...minimal separator, hereditary graph class, forbidden induced subgraph...
Ključne besede: minimal separator, hereditary graph class, forbidden induced subgraph
Objavljeno: 16.10.2019; Ogledov: 63; Prenosov: 27
URL Polno besedilo (0,00 KB)

Iskanje izvedeno v 0 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici