Domination number and upper embeddability of a simple graph

MaRDI QIDQ2858704zbMATH OpenFDO

Authors Tao Wang, Deming Li

Publication date 19 November 2013

Published in Journal of Anhui University. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

domination numberdegree sumdeficiencymaximum genusupper embeddability

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 907923
• Upper-embeddability of a graph G^3
• scientific article; zbMATH DE number 5630901
• Maximum genus, degree of vertex and girth
• A new bound on maximum genus of simple graphs.

This page was built for publication: Domination number and upper embeddability of a simple graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2858704)