Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings

DOI10.22108/toc.2021.126721.1802OpenAlexW3216439145MaRDI QIDQ5103954

Nuttawoot Nupo, Denpong Pongpipat

Publication date: 9 September 2022

Full work available at URL: https://doaj.org/article/ac5553db72ef4aa5a864ef302e0de0d1

zbMATH Keywords

unitary Cayley graphtree coverNordhaus-Gaddum type inequalitiestree covering number

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
• On the unitary Cayley graph of a ring
• Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
• Three ways to cover a graph
• Nordhaus-Gaddum type result for the matching number of a graph
• Covering the edges of a connected graph by paths
• Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers
• Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
• Some properties of unitary Cayley graphs
• On the unitary Cayley graph of a finite ring
• Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
• On the decomposition of a complete graph into planar subgraphs
• On Complementary Graphs
• Covering the Edges of Bipartite Graphs Using K 2,2 Graphs
• Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
• Nordhaus–Gaddum‐type Theorems for decompositions into many parts
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings