Remark to a problem on 0-1 matrices
The paper gives an account of previous and recent attempts to determine the order of a smallest graph not containing K₅ and such that every 2-coloring of its edges results in a monochromatic triangle. A new 14-vertex K₄-free graph with the same Ramsey property in the vertex coloring case is found. This yields a new construction of one of the only two known 15-vertex (3,3)-Ramsey graphs not containing K₅.
An R-tree is a geodesic space for which there is a unique arc joining any two of its points, and this arc is a metric segment. If X is a closed convex subset of an R-tree Y, and if T: X → 2Y is a multivalued mapping, then a point z for which [...] is called a point of best approximation. It is shown here that if T is an ε-semicontinuous mapping whose values are nonempty closed convex subsets of Y, and if T has at least two distinct points of best approximation, then T must have a fixed point. We...
A graph is called distance integral (or -integral) if all eigenvalues of its distance matrix are integers. In their study of -integral complete multipartite graphs, Yang and Wang (2015) posed two questions on the existence of such graphs. We resolve these questions and present some further results on -integral complete multipartite graphs. We give the first known distance integral complete multipartite graphs with , and with , as well as the infinite classes of distance integral complete...
Dynamic monopolies in graphs have been studied as a model for spreading processes within networks. Together with their dual notion, the generalized degenerate sets, they form the immediate generalization of the classical notions of vertex covers and independent sets in a graph. We present results concerning dynamic monopolies in graphs of given average threshold values extending and generalizing previous results of Khoshkhah et al. [On dynamic monopolies of graphs: The average and strict majority...
Given a graph G, its partially square graph G* is a graph obtained by adding an edge (u,v) for each pair u, v of vertices of G at distance 2 whenever the vertices u and v have a common neighbor x satisfying the condition , where . In the case where G is a claw-free graph, G* is equal to G². We define . We give for hamiltonicity and circumference new sufficient conditions depending on σ° and we improve some known results.
The restrained domination number and the total restrained domination number of a graph were introduced recently by various authors as certain variants of the domination number of . A well-known numerical invariant of a graph is the domatic number which is in a certain way related (and may be called dual) to . The paper tries to define analogous concepts also for the restrained domination and the total restrained domination and discusses the sense of such new definitions.
Let be a graph with vertices, edges and a vertex degree sequence , where . The spectral radius and the largest Laplacian eigenvalue are denoted by and , respectively. We determine the graphs with and the graphs with and We also present some sharp lower bounds for the Laplacian eigenvalues of a connected graph.
In this paper we compute some bounds of the Balaban index and then by means of group action we compute the Balaban index of vertex transitive graphs. ACM Computing Classification System (1998): G.2.2 , F.2.2.
This paper consists of two parts. The first part is devoted to the study of continuous diagrams and their connections with the boolean convolution. In the second part we investigate the rectangular Young diagrams and respective discrete measures. We recall the definition of Kerov's α-transformation of diagrams, define the α-transformation of finitely supported discrete measures and generalize the notion of the α-transformation.
We give a novel upper bound on graph energy in terms of the vertex cover number, and present a complete characterization of the graphs whose energy equals twice their matching number.