Affiliation:
1. Department of Mathematics, Wuyi University, Jiangmen 529020, China
Abstract
A 3-restricted edge cut is an edge cut of a connected graph that separates this graph into components, each having an order of at least 3. The minimum size of all 3-restricted edge cuts of a graph is called its 3-restricted edge connectivity. This work determines the upper and lower bounds on the 3-restricted edge connectivity of replacement product graphs and presents sufficient conditions for replacement product graphs to be maximally 3-restricted edge connected. As a result, the 3-restricted edge connectivity of replacement product graphs of some special graphs are determined.
Funder
National Natural Science Foundation of China
Guangdong Basic and Applied Basic Research foundation
the Special Foundation in Key Fields for Universities of Guangdong Province
Subject
Geometry and Topology,Logic,Mathematical Physics,Algebra and Number Theory,Analysis
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献