Maximal Resonance of {(3,4),4}-Fullerene Graphs

Expand
  • (School of Mathematics and Information Science, Henan Polytechnic University,
    Jiaozuo 454003, China
YANG Rui (1983-), female, native of Nanyang, Henan, lecturer of Henan Polytechnic University, engages in graph theory and matching theory; MA Yan-fei (1997-), female, native of Nanyang, Henan, graduate student of Henan Polytechnic University, engages in graph theory and matching theory.

Received date: 2022-07-08

  Online published: 2024-03-30

Supported by

 Supported by NSFC (Grant Nos. 11801148 and 11626089) and the Foundation for the
Doctor of Henan Polytechnic University (Grant No. B2014-060).

Abstract

A {(3,4),4}-fullerene graph S is a 4-regular map on the sphere whose faces are of length 3 or 4. It follows from Euler’s formula that the number of triangular faces is eight. A set H of disjoint quadrangular faces of S is called resonant pattern if S has a perfect matching M such that every quadrangular face in H is M-alternating. Let k be a positive integer, S is k-resonant if any i≤k disjoint quadrangular faces of S form a resonant pattern. Moreover, if graph S is k-resonant for any integer k, then S is called maximally resonant.

Cite this article

YANG Rui, MA Yan-fei . Maximal Resonance of {(3,4),4}-Fullerene Graphs[J]. Chinese Quarterly Journal of Mathematics, 2024 , 39(1) : 1 -17 . DOI: 10.13371/j.cnki.chin.q.j.m.2024.01.001

Outlines

/