QQ客服 官方微博 反馈留言

	Enumeration of perfect matchings in a type of graphs with reflective symmetry
	Zhang, FJ ; Yan, WG ; Zhang FJ(张福基)
	2003-02
英文摘要	Let G be a bipartite graph without 4k-cycles. It is well known ([1,2]) that M(G)=root\detA(G)\, where A(G) is the adjacency matrix of G and M(G) is the number of perfect matchings of G. In this paper we show that: if G is invariant under the reflection across some plane (or straight line) then M(G)=\det A (G(+))\ under some conditions, where G(+) is a graph with half of the number of vertices of G.
语种	英语
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/66356]
专题	数学科学－已发表论文
推荐引用方式 GB/T 7714	Zhang, FJ,Yan, WG,Zhang FJ. Enumeration of perfect matchings in a type of graphs with reflective symmetry[J],2003.
APA	Zhang, FJ,Yan, WG,&张福基.(2003).Enumeration of perfect matchings in a type of graphs with reflective symmetry..
MLA	Zhang, FJ,et al."Enumeration of perfect matchings in a type of graphs with reflective symmetry".(2003).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。