Displaying similar documents to “Integral representations of graphs.”

The Ramsey number.

Boza, Luis (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The irregularity of graphs under graph operations

Hosam Abdo, Darko Dimitrov (2014)

Discussiones Mathematicae Graph Theory

Similarity:

The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G). In this paper we consider the irregularity of graphs under several graph operations including join, Cartesian product, direct product, strong product, corona product, lexicographic product, disjunction and sym- metric difference. We give exact expressions or (sharp) upper bounds on the irregularity of graphs under the...

An extension of Rothe's method to non-cylindrical domains

Komil Kuliev, Lars-Erik Persson (2007)

Applications of Mathematics

Similarity:

In this paper Rothe’s classical method is extended so that it can be used to solve some linear parabolic boundary value problems in non-cylindrical domains. The corresponding existence and uniqueness theorems are proved and some further results and generalizations are discussed and applied.

Dominating and total dominating partitions in cubic graphs

Justin Southey, Michael Henning (2011)

Open Mathematics

Similarity:

In this paper, we continue the study of domination and total domination in cubic graphs. It is known [Henning M.A., Southey J., A note on graphs with disjoint dominating and total dominating sets, Ars Combin., 2008, 89, 159–162] that every cubic graph has a dominating set and a total dominating set which are disjoint. In this paper we show that every connected cubic graph on nvertices has a total dominating set whose complement contains a dominating set such that the cardinality of the...