Some Bounds on the Threshold Dimension of Graphs

Show simple item record
dc.contributor.authorFrancis, Mathew C.
dc.contributor.authorMajumder, Atrayee
dc.contributor.authorMathew, Rogers
dc.date.accessioned2026-02-27T19:05:38Z
dc.date.available2026-02-27T19:05:38Z
dc.date.issued2025
dc.date.updated2026-02-27T19:05:37Z
dc.description.abstractThe threshold dimension of a graph G is the minimum number of threshold graphs whose intersection yields G. We give tight or nearly tight upper bounds for the threshold dimension of a graph in terms of various graph parameters including treewidth, maximum degree, degeneracy, number of vertices, and vertex cover number. We also study threshold dimension of random graphs and graphs with high girth.en
dc.format18
dc.identifier.document-number001434398400001
dc.identifier.doi10.37236/12331
dc.identifier.issn1077-8926
dc.identifier.obd43947690
dc.identifier.orcidMajumder, Atrayee 0000-0002-6694-777X
dc.identifier.urihttp://hdl.handle.net/11025/67127
dc.language.isoen
dc.relation.ispartofseriesELECTRONIC JOURNAL OF COMBINATORICS
dc.rights.accessA
dc.subjectintersection dimensionen
dc.subjectthreshold dimensionen
dc.subjectboxicityen
dc.subjectthreshold graphsen
dc.subjectgraphic Boolean functionen
dc.subjectmajority gatesen
dc.subjectdepth-2 circuitsen
dc.subjecttreewidthen
dc.titleSome Bounds on the Threshold Dimension of Graphsen
dc.typeČlánek v databázi WoS (Jimp)
dc.typeČLÁNEK
dc.type.statusPublished Version
local.files.count1*
local.files.size350327*
local.has.filesyes*

Files

Original bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
12331-PDF file-53523-1-10-20250215.pdf
Size:
342.12 KB
Format:
Adobe Portable Document Format
Download
License bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Articles (NTIS)