Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 217, p. 375

Dvorák et al. introduced a variant of the Randi... index of a graph G, denoted by R'(G), where ..., and d(u) denotes the degree of a vertex u in G. The...

Studies | Coloring | Graph coloring | Upper bounds | Graph theory | Linear equations

Studies | Coloring | Graph coloring | Upper bounds | Graph theory | Linear equations

Journal Article

Discrete Dynamics in Nature and Society, ISSN 1026-0226, 12/2019, Volume 2019, pp. 1 - 4

For a digraph D, the feedback vertex number τD, (resp. the feedback arc number τ′D) is the minimum number of vertices, (resp. arcs) whose removal leaves the...

Problems | Hypotheses | Apexes | Feedback | Information processing | Graphs | Decomposition | Graph theory | Tournaments & championships | Cartesian coordinates

Problems | Hypotheses | Apexes | Feedback | Information processing | Graphs | Decomposition | Graph theory | Tournaments & championships | Cartesian coordinates

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 10/2015, Volume 194, pp. 147 - 153

It is well known that a graph is outerplanar if and only if it is K4 -minor free and K2 ,3 -minor free. Campos and Wakabayashi (2013) recently proved that...

Triangulation | K 4 -minor free graph | Outerplanar graph | K 2 , 3 -minor free graph | Domination number

Triangulation | K 4 -minor free graph | Outerplanar graph | K 2 , 3 -minor free graph | Domination number

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 10/2015, Volume 194, p. 147

To access, purchase, authenticate, or subscribe to the full-text of this article, please visit this link: http://dx.doi.org/10.1016/j.dam.2015.05.029 It is...

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 10/2015, Volume 194, pp. 147 - 153

It is well known that a graph is outerplanar if and only if it is K4-minor free and K2,3-minor free. Campos and Wakabayashi (2013) recently proved that...

[formula omitted]-minor free graph | Triangulation | Outerplanar graph | Domination number

[formula omitted]-minor free graph | Triangulation | Outerplanar graph | Domination number

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 02/2019, Volume 254, pp. 268 - 273

Very recently, Aouchiche and Hansen gave an upper bound on the ratio of GA∕χ of the geometric–arithmetic index GA(G) and the chromatic number χ(G) of a graph....

Chromatic number | Clique number | Geometric–arithmetic index | MATHEMATICS, APPLIED | BOUNDS | Geometric-arithmetic index | Upper bounds | Arithmetic

Chromatic number | Clique number | Geometric–arithmetic index | MATHEMATICS, APPLIED | BOUNDS | Geometric-arithmetic index | Upper bounds | Arithmetic

Journal Article

Match, ISSN 0340-6253, 2010, Volume 64, Issue 3, pp. 699 - 706

The Wiener index W(G) of a connected graph G is the sum of distances of all pairs of vertices in G. We show that for any connected graph G with delta(G) >= 2,...

DISTANCE | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | MATHEMATICS, INTERDISCIPLINARY APPLICATIONS | TREES | CHEMISTRY, MULTIDISCIPLINARY

DISTANCE | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | MATHEMATICS, INTERDISCIPLINARY APPLICATIONS | TREES | CHEMISTRY, MULTIDISCIPLINARY

Journal Article

Discrete Mathematics, Algorithms and Applications, ISSN 1793-8309, 10/2018, Volume 10, Issue 5

Journal Article

Journal of Inequalities and Applications, ISSN 1025-5834, 12/2014, Volume 2014, Issue 1, pp. 1 - 5

The purpose of the present note is to establish the weighted version of the handshaking lemma with an application to chemical graph theory.MSC:05C90.

Mathematics, general | Mathematics | the handshaking lemma | Applications of Mathematics | Randić index | Analysis | MATHEMATICS | MATHEMATICS, APPLIED | Randic index | GRAPHS | Graph theory | Inequalities

Mathematics, general | Mathematics | the handshaking lemma | Applications of Mathematics | Randić index | Analysis | MATHEMATICS | MATHEMATICS, APPLIED | Randic index | GRAPHS | Graph theory | Inequalities

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 07/2017, Volume 226, pp. 158 - 165

A P3⃗-decomposition of a directed graph D is a partition of the arcs of D into directed paths of length 2. In this paper, we give a characterization for a...

Line graphs | Tournaments | Bipartite digraphs | Path-decomposition | Perfect matchings

Line graphs | Tournaments | Bipartite digraphs | Path-decomposition | Perfect matchings

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 07/2017, Volume 226, p. 158

A P.sub.3a-decomposition of a directed graph D is a partition of the arcs of D into directed paths of length 2. In this paper, we give a characterization for a...

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 07/2017, Volume 226, p. 158

A ...-decomposition of a directed graph D is a partition of the arcs of D into directed paths of length 2. In this paper, we give a characterization for a...

Graph theory | Decomposition | Mathematics | Combinatorics | Symmetry

Graph theory | Decomposition | Mathematics | Combinatorics | Symmetry

Journal Article

Applied Mathematics and Computation, ISSN 0096-3003, 03/2018, Volume 321, pp. 431 - 441

A strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they are adjacent to a...

Generalized Petersen graphs | Strong chromatic index | Strong edge coloring | INDUCED MATCHINGS | MATHEMATICS, APPLIED | DOMINATION NUMBER | CUBIC HALIN GRAPHS | P(N

Generalized Petersen graphs | Strong chromatic index | Strong edge coloring | INDUCED MATCHINGS | MATHEMATICS, APPLIED | DOMINATION NUMBER | CUBIC HALIN GRAPHS | P(N

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 1/2017, Volume 33, Issue 1, pp. 28 - 34

Gyárfás conjectured that for a given forest F, there exists an integer function f(F, x) such that $$\chi (G)\le f(F,\omega (G))$$ χ ( G ) ≤ f ( F , ω ( G ) )...

Convex and Discrete Geometry | Triangle-free graph | Forbidden subgraph | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | Chromatic number | Optimization | Induced subgraph | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | SUBGRAPHS

Convex and Discrete Geometry | Triangle-free graph | Forbidden subgraph | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | Chromatic number | Optimization | Induced subgraph | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | SUBGRAPHS

Journal Article

Acta Mathematicae Applicatae Sinica, English Series, ISSN 0168-9673, 10/2018, Volume 34, Issue 4, pp. 801 - 812

A subset S ⊆ V in a graph G = (V,E) is a total [1, 2]-set if, for every vertex $$ \upsilon \in V, 1 \leq\mid N (\upsilon)\cap S\mid\leq $$ υ ∈ V , 1 ≤∣ N ( υ )...

total [1, 2]-domination number | Theoretical, Mathematical and Computational Physics | total [1, 2]-set | Mathematics | Applications of Mathematics | Math Applications in Computer Science | [1, 2]-set | 05C69 | [1,2]-set | MATHEMATICS, APPLIED | total [1,2]-domination number | TOTAL DOMINATION | total [1,2]-set

total [1, 2]-domination number | Theoretical, Mathematical and Computational Physics | total [1, 2]-set | Mathematics | Applications of Mathematics | Math Applications in Computer Science | [1, 2]-set | 05C69 | [1,2]-set | MATHEMATICS, APPLIED | total [1,2]-domination number | TOTAL DOMINATION | total [1,2]-set

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 5/2017, Volume 33, Issue 4, pp. 1266 - 1275

A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching, while the paired-domination number is the...

Domination | Regular graphs | Paired-domination number | Convex and Discrete Geometry | Claw-free graphs | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | Optimization | Cubic graphs | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | BOUNDS | FREE CUBIC GRAPHS | MATCHINGS | INDEPENDENT SETS

Domination | Regular graphs | Paired-domination number | Convex and Discrete Geometry | Claw-free graphs | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | Optimization | Cubic graphs | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | BOUNDS | FREE CUBIC GRAPHS | MATCHINGS | INDEPENDENT SETS

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 217, pp. 375 - 380

Dvořák et al. introduced a variant of the Randić index of a graph G, denoted by R′(G), where R′(G)=∑uv∈E(G)1max{d(u),d(v)}, and d(u) denotes the degree of a...

Achromatic number | Randić index | Chromatic number | Coloring number | EIGENVALUES | MATHEMATICS, APPLIED | Randic index | TOPOLOGICAL INDEXES

Achromatic number | Randić index | Chromatic number | Coloring number | EIGENVALUES | MATHEMATICS, APPLIED | Randic index | TOPOLOGICAL INDEXES

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 5/2018, Volume 35, Issue 4, pp. 997 - 1008

Motivated by the connection with the genus of unoriented alternating links, Jin et al. (Acta Math Appl Sin Engl Ser, 2015) introduced the number of maximum...

Spanning trees | State circle | Convex and Discrete Geometry | Operations Research/Decision Theory | Mathematics | Theory of Computation | Polynomial-time algorithm | Mathematical Modeling and Industrial Mathematics | Combinatorics | Optimization | Link | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | GENUS | LINKS | Algorithms

Spanning trees | State circle | Convex and Discrete Geometry | Operations Research/Decision Theory | Mathematics | Theory of Computation | Polynomial-time algorithm | Mathematical Modeling and Industrial Mathematics | Combinatorics | Optimization | Link | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | GENUS | LINKS | Algorithms

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 10/2014, Volume 175, pp. 79 - 86

A vertex subset D of a graph G=(V,E) is a [1,2]-set if, 1≤|N(v)∩D|≤2 for every vertex vεV\D, that is, each vertex vεV\D is adjacent to either one or two...

Domination | Lexicographic product | [1, 2]-sets | Restrained domination | Nordhaus-Gaddum | MATHEMATICS, APPLIED | [1,2]-sets | Trees | Leaves | Graphs | Tasks | Mathematical analysis | Inequalities

Domination | Lexicographic product | [1, 2]-sets | Restrained domination | Nordhaus-Gaddum | MATHEMATICS, APPLIED | [1,2]-sets | Trees | Leaves | Graphs | Tasks | Mathematical analysis | Inequalities

Journal Article

Applied Mathematics and Computation, ISSN 0096-3003, 09/2018, Volume 332, pp. 90 - 95

Let G=(V,E) be a graph of order n, and λ=(λ1,λ2,…,λp) a sequence of positive integers. The sequence λ is admissible for G if λ1+⋯+λp=n. Such an admissible...

Caterpillars | Cartesian product of graphs | Arbitrarily partitionable graphs | MATHEMATICS, APPLIED | VERTEX-DECOMPOSABLE GRAPHS | CONNECTIVITY

Caterpillars | Cartesian product of graphs | Arbitrarily partitionable graphs | MATHEMATICS, APPLIED | VERTEX-DECOMPOSABLE GRAPHS | CONNECTIVITY

Journal Article

No results were found for your search.

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