Intersection dimension and graph invariants

Aravind, N.R. and Subramanian, C.R. (2021) Intersection dimension and graph invariants. Discussiones Mathematicae Graph Theory, 41 (1). p. 153. ISSN 1234-3099

Full text not available from this repository. (Request a copy)

Abstract

We show that the intersection dimension of graphs with respect to several hereditary properties can be bounded as a function of the maximum degree. As an interesting special case, we show that the circular dimension of a graph with maximum degree Δis at most O(ΔlogΔ/log logΔ) . It is also shown that permutation dimension of any graph is at most Δ(log Δ)1+o(1). We also obtain bounds on intersection dimension in terms of treewidth.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Aravind, N Rhttps://orcid.org/0000-0002-6590-7952
Item Type: Article
Uncontrolled Keywords: circular dimension; dimensional properties; forbidden-subgraph colorings
Subjects: Computer science
Divisions: Department of Computer Science & Engineering
Depositing User: . LibTrainee 2021
Date Deposited: 30 Jul 2021 04:17
Last Modified: 07 Mar 2022 06:14
URI: http://raiith.iith.ac.in/id/eprint/8569
Publisher URL: http://doi.org/10.7151/dmgt.2173
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 8569 Statistics for this ePrint Item