REGULARITY of POWERS of BIPARTITE GRAPHS

Full metadata record

DC Field	Value	Language
dc.contributor.author	Kumar A.	en_US
dc.contributor.author	Kumar R.	en_US
dc.date.accessioned	2023-11-30T08:42:47Z	-
dc.date.available	2023-11-30T08:42:47Z	-
dc.date.issued	2023	-
dc.identifier.issn	0004-9727	-
dc.identifier.other	EID(2-s2.0-85147106477)	-
dc.identifier.uri	https://dx.doi.org/10.1017/S0004972722000855	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/596	-
dc.description.abstract	For a simple bipartite graph G, we give an upper bound for the regularity of powers of the edge ideal I(G) in terms of its vertex domination number. Consequently, we explicitly compute the regularity of powers of the edge ideal of a bipartite Kneser graph. Further, we compute the induced matching number of a bipartite Kneser graph. © The Author(s), 2022. Published by Cambridge University Press on behalf of Australian Mathematical Publishing Association Inc.	en_US
dc.language.iso	en	en_US
dc.publisher	Cambridge University Press	en_US
dc.source	Bulletin of the Australian Mathematical Society	en_US
dc.subject	bipartite Kneser graph	en_US
dc.subject	edge ideal	en_US
dc.subject	regularity	en_US
dc.subject	vertex domination number	en_US
dc.title	REGULARITY of POWERS of BIPARTITE GRAPHS	en_US
dc.type	Journal Article	en_US
Appears in Collections:	Journal Article