Graphs Generated by Measures
In this paper, a graph is assigned to any probability measure on the σ-algebra of Borel sets of a topological space. Using this construction, it is proved that given any number n (finite or infinite) there exists a nonregular graph such that its clique, chromatic, and dominating number equals n.
Saved in:
Main Authors: | A. Assari, M. Rahimi |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2016-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2016/1706812 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
School performance gap between non-immigrant and second-generation immigrant children in Sweden—time trends and contributing factors
by: Kenta Okuyama, et al.
Published: (2025-01-01) -
Learning with semantic ambiguity for unbiased scene graph generation
by: Shanjin Zhong, et al.
Published: (2025-01-01) -
Measuring the Inferential Values of Relations in Knowledge Graphs
by: Xu Zhang, et al.
Published: (2024-12-01) -
VisGraphVar: A benchmark generator for Assessing Variability in Graph Analysis Using Large Vision-Language Models
by: Camilo Chacon Sartori, et al.
Published: (2025-01-01) -
Structify-Net: Random Graph generation with controlled size and customized structure
by: Cazabet, Remy, et al.
Published: (2023-10-01)