Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 2019

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 06/2019, Volume 263, pp. 212 - 219

Let e be an edge of a connected simple graph G. The graph obtained by removing (resp. subdividing) an edge e from G is denoted by G−e (resp. Ge). As usual,...

[formula omitted]-critical graph | Domination number | Tree | [formula omitted]-insensitive graph | Edge removing | Efficient graph | Edge subdividing | Vizing’s Conjecture | Vizing's Conjecture | γ-insensitive graph | critical graph | MATHEMATICS, APPLIED | gamma(sd)-critical graph | gamma-insensitive graph | Graphs

[formula omitted]-critical graph | Domination number | Tree | [formula omitted]-insensitive graph | Edge removing | Efficient graph | Edge subdividing | Vizing’s Conjecture | Vizing's Conjecture | γ-insensitive graph | critical graph | MATHEMATICS, APPLIED | gamma(sd)-critical graph | gamma-insensitive graph | Graphs

Journal Article

2009, London Mathematical Society lecture note series, ISBN 0521757681, Volume 362., ix, 452

This volume provides a systematic presentation of the theory of differential tensor algebras and their categories of modules. It involves reduction techniques...

Categories (Mathematics) | Tensor algebra | Representations of algebras

Categories (Mathematics) | Tensor algebra | Representations of algebras

Book

Discrete Applied Mathematics, ISSN 0166-218X, 07/2019, Volume 265, pp. 142 - 157

In this paper, we study the concept of convex domination in maximal outerplanar graphs. For this class of graphs, we discuss several properties of this...

Outerplanar | Convex guard set | Flipping edge | Convex domination | MATHEMATICS, APPLIED | NUMBERS | FLIP DISTANCE | TRIANGULATIONS | MONADIC 2ND-ORDER LOGIC | ALGORITHMS | Algorithms | Upper bounds | Graphs

Outerplanar | Convex guard set | Flipping edge | Convex domination | MATHEMATICS, APPLIED | NUMBERS | FLIP DISTANCE | TRIANGULATIONS | MONADIC 2ND-ORDER LOGIC | ALGORITHMS | Algorithms | Upper bounds | Graphs

Journal Article

Australasian Journal of Combinatorics, ISSN 1034-4942, 02/2019, Volume 73, Issue 2, pp. 334 - 345

Journal Article

Utilitas Mathematica, ISSN 0315-3681, 11/2017, Volume 105, pp. 337 - 341

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 05/2017, Volume 37, Issue 2, pp. 383 - 397

A set of vertices D of a graph G is a distance 2-dominating set of G if the distance between each vertex u ∊ (V (G) − D) and D is at most two. Let γ (G) denote...

universal fixer | distance 2 dominating set | prisms of graphs | Universal fixer | Prisms of graphs | Distance 2-dominating set | MATHEMATICS | distance 2-dominating set | UNIVERSAL FIXERS | Grafs, Teoria de | 05 Combinatorics | Teoria de grafs | 05C Graph theory | Matemàtiques i estadística | Matemàtica discreta | Graph theory | Classificació AMS | Àrees temàtiques de la UPC

universal fixer | distance 2 dominating set | prisms of graphs | Universal fixer | Prisms of graphs | Distance 2-dominating set | MATHEMATICS | distance 2-dominating set | UNIVERSAL FIXERS | Grafs, Teoria de | 05 Combinatorics | Teoria de grafs | 05C Graph theory | Matemàtiques i estadística | Matemàtica discreta | Graph theory | Classificació AMS | Àrees temàtiques de la UPC

Journal Article

GRAPHS AND COMBINATORICS, ISSN 0911-0119, 07/2017, Volume 33, Issue 4, pp. 991 - 998

In this note we present an alternative proof of the result by Dorfling et al. (Discrete Math 339(3):1180-1188, 2016) establishing that any maximal outerplanar...

Domination | MATHEMATICS | Watched guards | Total domination | Outerplanar graph

Domination | MATHEMATICS | Watched guards | Total domination | Outerplanar graph

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 08/2016, Volume 36, Issue 3, pp. 661 - 668

We consider (ψ −γ )-perfect graphs, i.e., graphs G for which ψ (H) = γ (H) for any induced subgraph H of G, where ψ and γ are the k-path vertex cover number...

k-path vertex cover | perfect graphs | distance k-domination number | Distance k-domination number | K-path vertex cover | Perfect graphs | MATHEMATICS | DOMINATION

k-path vertex cover | perfect graphs | distance k-domination number | Distance k-domination number | K-path vertex cover | Perfect graphs | MATHEMATICS | DOMINATION

Journal Article

Discrete Mathematics, ISSN 0012-365X, 11/2015, Volume 338, Issue 11, pp. 1982 - 1988

Let T be a 3-partite tournament and F3(T) be the set of vertices of T not in triangles. We prove that, if the global irregularity of T, ig(T), is one and...

Tripartite tournaments | [formula omitted]-free vertices | Global irregularity | C 3 →-free vertices | MATHEMATICS | MULTIPARTITE TOURNAMENTS | (C-3)over-right-arrow-free vertices

Tripartite tournaments | [formula omitted]-free vertices | Global irregularity | C 3 →-free vertices | MATHEMATICS | MULTIPARTITE TOURNAMENTS | (C-3)over-right-arrow-free vertices

Journal Article

Mathematica Bohemica, ISSN 0862-7959, 2015, Volume 140, Issue 3, pp. 361 - 367

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2010, Volume 310, Issue 19, pp. 2482 - 2488

Let T be a 3-partite tournament. We say that a vertex v is C 3 ⃗ -free if v does not lie on any directed triangle of T . Let F 3 ( T ) be the set of the C 3 ⃗...

Directed triangle free vertex | Regular 3-partite tournament

Directed triangle free vertex | Regular 3-partite tournament

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 05/2015, Volume 35, Issue 2, pp. 315 - 327

The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be...

(total) domination subdivision number | (total) domination multisubdivision number | trees | (total) domination | Trees | MATHEMATICS | SUBDIVISION NUMBERS

(total) domination subdivision number | (total) domination multisubdivision number | trees | (total) domination | Trees | MATHEMATICS | SUBDIVISION NUMBERS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 10/2010, Volume 310, Issue 19, pp. 2482 - 2488

Let T be a 3-partite tournament. We say that a vertex v is [MathML equation]-free if v does not lie on any directed triangle of T. Let F sub(3)(T) be the set...

Mathematical analysis | Triangles

Mathematical analysis | Triangles

Journal Article

Discrete Mathematics, ISSN 0012-365X, 10/2010, Volume 310, Issue 19, p. 2482

Let T be a 3-partite tournament. We say that a vertex v is C.sub.3a-free if v does not lie on any directed triangle of T. Let F.sub.3(T) be the set of the...

Journal Article

Discrete Mathematics, ISSN 0012-365X, 10/2010, Volume 310, Issue 19, pp. 2482 - 2488

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 7/2014, Volume 30, Issue 4, pp. 783 - 800

A digraph D of order n is r-hypohamiltonian (respectively r-hypotraceable) for some positive integer r < n − 1 if D is nonhamiltonian (nontraceable) and the...

05C20 | hypohamiltonian | hypotraceable | Mathematics | Engineering Design | 2-hypohamiltonian | 2-hypotraceable | hypo-hypotraceable | Path Partition Conjecture | hypo-hypohamiltonian | Combinatorics | Traceability Conjecture | 05C38 | MATHEMATICS | DIGRAPHS | Graphs | Integers | Partitions | Construction | Deletion | Graph theory | Joints | Combinatorial analysis

05C20 | hypohamiltonian | hypotraceable | Mathematics | Engineering Design | 2-hypohamiltonian | 2-hypotraceable | hypo-hypotraceable | Path Partition Conjecture | hypo-hypohamiltonian | Combinatorics | Traceability Conjecture | 05C38 | MATHEMATICS | DIGRAPHS | Graphs | Integers | Partitions | Construction | Deletion | Graph theory | Joints | Combinatorial analysis

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 05/2015, Volume 186, Issue 1, pp. 251 - 259

In 1978, C. Thomassen proved that in any graph one can destroy all the longest cycles by deleting at most one third of the vertices. We show that for graphs...

Circumference | Vertex deletion | Longest cycle | MATHEMATICS, APPLIED

Circumference | Vertex deletion | Longest cycle | MATHEMATICS, APPLIED

Journal Article

Discussiones Mathematicae - Graph Theory, ISSN 1234-3099, 2012, Volume 32, Issue 4, pp. 807 - 812

In [1] Burger and Mynhardt introduced the idea of universal fixers. Let G = (V, E) be a graph with n vertices and G' a copy of G. For a bijective function pi :...

Dominating sets | Convex sets | Universal fixers | MATHEMATICS | universal fixers | convex sets | dominating sets

Dominating sets | Convex sets | Universal fixers | MATHEMATICS | universal fixers | convex sets | dominating sets

Journal Article

02/2017

Let $D=(V,A)$ be a digraph. A subset $S$ of $V$ is called a twin dominating set of $D$ if for every vertex $v\in V-S$, there exists vertices $u_1,u_2 \in S$...

Mathematics - Combinatorics

Mathematics - Combinatorics

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.