On the alpha-labeling number of bipartite graphs

dc.citation.epage	152	en_US
dc.citation.issue		en_US
dc.citation.spage	145	en_US
dc.citation.volume	58	en_US
dc.citation.woscount	1
dc.contributor.author	El-Zanati, S	en_US
dc.contributor.author	Eynden, CV	en_US
dc.contributor.author	Fu, HL	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.date.accessioned	2014-12-08T15:44:43Z
dc.date.available	2014-12-08T15:44:43Z
dc.date.issued	2000-11-01	en_US
dc.description.abstract	We show that if G is the vertex-disjoint union of graphs with alpha -labelings, or if G is a comet, then there exists a graph H with an alpha -labeling such that H decomposes into two copies of G.	en_US
dc.identifier.issn	0315-3681	en_US
dc.identifier.journal	UTILITAS MATHEMATICA	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/30183
dc.identifier.wosnumber	WOS:000166163600010
dc.language.iso	en_US	en_US
dc.subject	alpha-labeling number	en_US
dc.subject	bipartite	en_US
dc.subject	comet	en_US
dc.subject	hammock	en_US
dc.title	On the alpha-labeling number of bipartite graphs	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1