Share Your Research, Maximize Your Social Impacts
Edge scattering number of gear graphs
Journal: Bulletin of the International Mathematical Virtual Institute (Vol.5, No. 1)Publication Date: 2015-06-01
Authors : Ersin Aslan; Omur Kivanc Kurkcu;
Page : 25-31
Keywords : Vulnerability; Connectivity; Edge connectivity; Edge scattering number; Scattering number.;
Source : Download Find it from : Google Scholar
Abstract
The edge scattering number of a noncomplete connected graph G is de ned to be es(G) = maxf!(G
Other Latest Articles
- Nonexistence of positive solutions for a system of higher-order nonlinear boundary value problems
- Multiple Positive Solutions for the System of (n, p)-type Fractional Order Boundary Value Problems
- Educating teachers to pose mathematical problems in the digital age: Toward alternative ways of curriculum design
- Analysis of student’s mental structures when incorrectly calculating the limit of function
- The increase in efficiency of interactive learning of mathematics through the implementation of mini exemplary teaching
Last modified: 2016-01-27 18:15:56