GRAPHS WITH ISOMORPHIC NEIGHBOR-SUBGRAPHS

Simple item page
dc.citation.epage1182en_US
dc.citation.issue3en_US
dc.citation.spage1171en_US
dc.citation.volume15en_US
dc.citation.woscount0
dc.contributor.authorChan, Chi-Fengen_US
dc.contributor.authorFu, Hung-Linen_US
dc.contributor.authorLi, Chao-Fangen_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.date.accessioned2014-12-08T15:33:05Z
dc.date.available2014-12-08T15:33:05Z
dc.date.issued2011-06-01en_US
dc.description.abstractA graph G is said to be H-regular if for each vertex v is an element of V(G), the graph induced by N(G)(v) is isomorphic to H. A graph H is a feasible neighbor-subgraph if there exists an H-regular graph, otherwise H is a forbidden neighbor-subgraph. In this paper, we obtain some classes of graphs H which are forbidden and then we focus on searching H-regular graphs especially those graphs of smaller order.en_US
dc.identifier.issn1027-5487en_US
dc.identifier.journalTAIWANESE JOURNAL OF MATHEMATICSen_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/23036
dc.identifier.wosnumberWOS:000291757100016
dc.language.isoen_USen_US
dc.subjectNeighboren_US
dc.subjectIsomorphic subgraphsen_US
dc.titleGRAPHS WITH ISOMORPHIC NEIGHBOR-SUBGRAPHSen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download

Collections

期刊論文;;Articles