The Pfaffian property of graphs is of fundamental importance in graph theory,as it precisely characterizes those graphs for which the number of perfect matchings can be computed in polynomial time with respect to the ...The Pfaffian property of graphs is of fundamental importance in graph theory,as it precisely characterizes those graphs for which the number of perfect matchings can be computed in polynomial time with respect to the number of edges.The study of Pfaffian graphs originated from the enumeration of perfect matching in planar graphs.References[5,6,8]demonstrated that every planar graph is Pfaffian.Therefore,the Pfaffian property and planarity of graphs play a vital role in modern matching theory.This paper contributes a complete characterization of the Pfaffian property and planarity of connected Cayley graphs over the dicyclic group T_(4n) of order 4n(n≥3),shows that the Cayley graph Cay(T_(4n),S)is Pfaffian if and only if n is odd and S={a^(k_(1)),a^(2n−k_(1)),ba^(k_(2)),ba^(n+k_(2))},where 1≤k_(1)≤n−1,0≤k_(2)≤n−1 and(k_(1),n)=1,and furthermore,shows that Cay(T4n,S)is never planar.展开更多
For a group G and a non-empty subsetΩof G,the commuting graph C(G,Ω)ofΩis a graph whose vertex set isΩand any two vertices are adjacent if and only if they commute in G.Define T4n=(a,b|a^(2)n=b^(4)=1,an=b2,b^(−1)a...For a group G and a non-empty subsetΩof G,the commuting graph C(G,Ω)ofΩis a graph whose vertex set isΩand any two vertices are adjacent if and only if they commute in G.Define T4n=(a,b|a^(2)n=b^(4)=1,an=b2,b^(−1)ab=a^(−1)),the dicyclic group of order 4n(n≥3),which is also known as the generalized quaternion group.We mainly investigate the properties and metric dimension of the commuting graphs on the dicyclic group T4n.展开更多
基金supported by NSFC(No.12201202)NSF of Hunan Province(No.2023JJ30180)NSFC(No.12471022)。
文摘The Pfaffian property of graphs is of fundamental importance in graph theory,as it precisely characterizes those graphs for which the number of perfect matchings can be computed in polynomial time with respect to the number of edges.The study of Pfaffian graphs originated from the enumeration of perfect matching in planar graphs.References[5,6,8]demonstrated that every planar graph is Pfaffian.Therefore,the Pfaffian property and planarity of graphs play a vital role in modern matching theory.This paper contributes a complete characterization of the Pfaffian property and planarity of connected Cayley graphs over the dicyclic group T_(4n) of order 4n(n≥3),shows that the Cayley graph Cay(T_(4n),S)is Pfaffian if and only if n is odd and S={a^(k_(1)),a^(2n−k_(1)),ba^(k_(2)),ba^(n+k_(2))},where 1≤k_(1)≤n−1,0≤k_(2)≤n−1 and(k_(1),n)=1,and furthermore,shows that Cay(T4n,S)is never planar.
基金This work was supported by NSFC Grant 11871206Natural Science Foundation of Hunan Province(No.2020JJ4233,No.2020JJ5096).
文摘For a group G and a non-empty subsetΩof G,the commuting graph C(G,Ω)ofΩis a graph whose vertex set isΩand any two vertices are adjacent if and only if they commute in G.Define T4n=(a,b|a^(2)n=b^(4)=1,an=b2,b^(−1)ab=a^(−1)),the dicyclic group of order 4n(n≥3),which is also known as the generalized quaternion group.We mainly investigate the properties and metric dimension of the commuting graphs on the dicyclic group T4n.
