scholarly journals On the reflexive edge strength of the circulant graphs

2021 ◽  
Vol 6 (9) ◽  
pp. 9342-9365
Author(s):  
Mohamed Basher ◽  
Keyword(s):  
Circulant Graphs ◽  
Edge Strength

UNICUT

Alloy Digest ◽  
1953 ◽  
Vol 2 (12) ◽  
Keyword(s):  
High Speed ◽  
High Speed Steel ◽  
Heat Treating ◽  
Edge Strength

Abstract UNICUT is a molybdenum-tungsten type of high-speed steel containing relatively high percentages of carbon and vanadium. It possesses extremely high edge strength at high hardnesses. This datasheet provides information on composition and hardness. It also includes information on forming, heat treating, machining, and joining. Filing Code: TS-14. Producer or source: Cyclops Corporation.

AL TECH D-5

Alloy Digest ◽  
1980 ◽  
Vol 29 (11) ◽  
Keyword(s):  
Fracture Toughness ◽  
Physical Properties ◽  
Abrasion Resistance ◽  
Heat Treating ◽  
High Carbon ◽  
Die Steel ◽  
High Chromium ◽  
Die Steels ◽  
Edge Strength ◽  
Specialty Steel

Abstract AL Tech D-5 is a high-carbon, high-chromium tool and die steel; it contains cobalt (3.30%) and is air-hardening and nondeforming. The cobalt impacts a pronounced secondary hardening effect in tempering and a non-galling effect. AL Tech D-5 has both superior abrasion resistance and greater edge strength than ordinary high-carbon, high-chromium die steels. It is used for many types of dies, hot-piercing punches and shear blades. This datasheet provides information on composition, physical properties, and hardness as well as fracture toughness. It also includes information on forming, heat treating, and machining. Filing Code: TS-372. Producer or source: AL Tech Specialty Steel Corporation.

scholarly journals Superpixel Segmentation Based on Anisotropic Edge Strength

2019 ◽  
Vol 5 (6) ◽  
pp. 57 ◽  
Author(s):  
Gang Wang ◽  
Bernard De Baets
Keyword(s):  
Distance Measure ◽  
Saliency Detection ◽  
Experimental Results ◽  
Segmentation Method ◽  
Superpixel Segmentation ◽  
Gaussian Kernels ◽  
First Derivative ◽  
Edge Strength

Superpixel segmentation can benefit from the use of an appropriate method to measure edge strength. In this paper, we present such a method based on the first derivative of anisotropic Gaussian kernels. The kernels can capture the position, direction, prominence, and scale of the edge to be detected. We incorporate the anisotropic edge strength into the distance measure between neighboring superpixels, thereby improving the performance of an existing graph-based superpixel segmentation method. Experimental results validate the superiority of our method in generating superpixels over the competing methods. It is also illustrated that the proposed superpixel segmentation method can facilitate subsequent saliency detection.

scholarly journals The energy of integral circulant graphs with prime power order

2011 ◽  
Vol 5 (1) ◽  
pp. 22-36 ◽  
Author(s):  
J.W. Sander ◽  
T. Sander
Keyword(s):  
Adjacency Matrix ◽  
Prime Power ◽  
Prime Power Order ◽  
Circulant Graph ◽  
Closed Formula ◽  
Circulant Graphs ◽  
Vertex Set

The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs. Such a graph can be characterized by its vertex count n and a set D of divisors of n such that its vertex set is Zn and its edge set is {{a,b} : a, b ? Zn; gcd(a-b, n)? D}. For an integral circulant graph on ps vertices, where p is a prime, we derive a closed formula for its energy in terms of n and D. Moreover, we study minimal and maximal energies for fixed ps and varying divisor sets D.

scholarly journals Some star extremal circulant graphs

2003 ◽  
Vol 271 (1-3) ◽  
pp. 169-177 ◽  
Author(s):  
Wensong Lin
Keyword(s):  
Circulant Graphs

Community detection in social networks based on information propagation and user engagement

2021 ◽  
pp. 2150119
Author(s):  
Fuzhong Nian ◽  
Li Luo ◽  
Xuelong Yu ◽  
Xin Guo
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Detection Method ◽  
User Engagement ◽  
Connection Strength ◽  
Information Propagation ◽  
Edge Strength ◽  
Strength Based ◽  
Network Propagation ◽  
Overlapping Community

The iterative propagation of information between nodes will strengthen the connection strength between nodes, and the network can evolve into different groups according to difference edge strength. Based on this observation, we present the user engagement to quantify the influences of users different propagation modes to network propagation, and construct weight network to simulate real social network, and proposed the community detection method in social networks based on information propagation and user engagement. Our method can produce different scale communities and overlapping community. We also applied our method to real-world social networks. The experiment proved that the network spread and the community division interact with each other. The community structure is significantly different in the network propagation of different scales.

Kernel in Oriented Circulant Graphs

2009 ◽  
pp. 396-407 ◽  
Author(s):  
Paul Manuel ◽  
Indra Rajasingh ◽  
Bharati Rajan ◽  
Joice Punitha
Keyword(s):  
Circulant Graphs

scholarly journals Cycle Embedding in Generalized Recursive Circulant Graphs

2018 ◽  
Vol E101.D (12) ◽  
pp. 2916-2921
Author(s):  
Shyue-Ming TANG ◽  
Yue-Li WANG ◽  
Chien-Yi LI ◽  
Jou-Ming CHANG
Keyword(s):  
Circulant Graphs
Sign in / Sign up

Export Citation Format

Share Document