Abstract
In this paper, the relationship between non-separating independent number and the maximum genus of a 3-regular simplicial graph is presented. A lower bound on the maximum genus of a 3-regular graph involving girth is provided. The lower bound is tight, it improves a bound of Huang and Liu.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chen, J., Archdeacon, D. and Gross, J.L., Maximum genus and connectivity, Discrete Math., 1996, 149:19–29.
Chen, J., Kanchi, S.P. and Gross, J.L., A tight lower bound on maximum genus of a simplicial graph, Discrete Math., 1996, 156:83–102.
Kundu, S., Bounds on number of disjoint spanning trees, J. Combin. Theory Ser. B, 1974, 17:199–203.
Liu, Y., Embeddability in Graphs, Kluwer & Science, Dordrecht, 1995.
Speckenmeyer, E., On the feedback vertex set and nonseparating independent sets in cubic graphs, J. Graph Theory, 1988, 12:405–412.
Xuong, N.H., How to determine the maximum genus of a graph, J. Combin. Theory Ser. B, 1979, 26:217–224.
Jungerman, M., A characterization of upper embeddable graphs, Trans. Amer. Math. Soc., 1978, 241:401–406.
Huang, Y. and Liu, Y., Maximum genus and maximum nonseparating independent set of a 3-regular graph, Discrete Math., 1997, 176:149–158.
Staton, W., Induced forests in cubic graphs, Discrete Math., 1984, 49:175–178.
Bondy, J.A., Hopkins, G. and Staton, W., Lower bounds for induced forests in cubic graphs, Canad. Math. Bull., 1987, 30:193–199.
Xuong, N.H., Upper embeddable graphs and related topics, J. Combin. Theory Ser. B, 1979, 26: 225–232.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Deming, L., Yanpei, L. The maximum genus of a 3-regular simplicial graph. Appl. Math. Chin. Univ. 14, 203–214 (1999). https://doi.org/10.1007/s11766-999-0027-9
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11766-999-0027-9