Search
Search Results
-
Distances in Zero-divisor Graphs
These concepts are the considerations of this chapter. Actually, we present results concerning the diameter, girth, and center of the zero-divisor...
-
Odd Distances in Colourings of the Plane
We prove that every finite colouring of the plane contains a monochromatic pair of points at an odd distance from each other.
-
A measure-theoretic representation of graphs
Inspired by the notion of action convergence in graph limit theory, we introduce a measure-theoretic representation of matrices, and we use it to...
-
On New Record Graphs Close to Bipartite Moore Graphs
The modelling of interconnection networks by graphs motivated the study of several extremal problems that involve well known parameters of a graph...
-
Complexity of distances: Reductions of distances between metric and Banach spaces
We show that all the standard distances from metric geometry and functional analysis, such as Gromov—Hausdorff distance, Banach—Mazur distance,...
-
Graphs with convex balls
In this paper, we investigate the graphs in which all balls are convex and the groups acting on them geometrically (which we call CB-graphs and...
-
-
-
Gromov hyperbolicity of Johnson and Kneser graphs
The concept of Gromov hyperbolicity is a geometric concept that leads to a rich general theory. Johnson and Kneser graphs are interesting...
-
Orthogonality Graphs of Direct Sums of Rings and Semisimple Artinian Rings
The paper studies the orthogonality relation graphs for noncommutative rings. Known results on the diameters of the connected components of simple...
-
Wiener index of graphs with fixed number of pendant or cut-vertices
The Wiener index of a connected graph is defined as the sum of the distances between all unordered pairs of its vertices. We characterize the graphs...
-
Embedding Dimensions of Matrices Whose Entries are Indefinite Distances in the Pseudo-Euclidean Space
A finite set of the Euclidean space is called an s -distance set provided that the number of Euclidean distances in the set is s . Determining the...
-
Critical Subgraphs of Schrijver Graphs for the Fractional Chromatic Number
Schrijver graphs are vertex-color-critical subgraphs of Kneser graphs having the same chromatic number. They also share the value of their fractional...
-
MCMC sampling of directed flag complexes with fixed undirected graphs
Constructing null models to test the significance of extracted information is a crucial step in data analysis. In this work, we provide a uniformly...
-
-
-
-
Embedding 4-Chromatic Graphs in the Plane
In Chaps. 1 and 2 , we got acquainted with examples of...
-
