scholarly journals Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs

2013 ◽  
Vol 26 (1) ◽  
pp. 120-123 ◽  
Author(s):  
Litao Guo ◽  
Weihua Yang ◽  
Xiaofeng Guo
Keyword(s):  
Complete Graphs ◽  
Kronecker Products ◽  
Super Connectivity ◽  
Split Graphs

scholarly journals Onr-equitable chromatic threshold of Kronecker products of complete graphs

2014 ◽  
Vol 175 ◽  
pp. 129-134
Author(s):  
Wei Wang ◽  
Zhidan Yan ◽  
Xin Zhang
Keyword(s):  
Complete Graphs ◽  
Kronecker Products

scholarly journals On the super connectivity of Kronecker products of graphs

2012 ◽  
Vol 112 (10) ◽  
pp. 402-405 ◽  
Author(s):  
Hechao Wang ◽  
Erfang Shan ◽  
Wei Wang
Keyword(s):  
Kronecker Products ◽  
Super Connectivity

Super connectivity of Kronecker products of graphs

2010 ◽  
Vol 110 (16) ◽  
pp. 659-661 ◽  
Author(s):  
Litao Guo ◽  
Chengfu Qin ◽  
Xiaofeng Guo
Keyword(s):  
Kronecker Products ◽  
Super Connectivity

Roulette Wheel Selection based Heuristic Algorithm for the Orienteering Problem

2014 ◽  
Vol 13 (1) ◽  
pp. 4127-4145
Author(s):  
Madhushi Verma ◽  
Mukul Gupta ◽  
Bijeeta Pal ◽  
Prof. K. K. Shukla
Keyword(s):  
Triangle Inequality ◽  
Time Budget ◽  
Control Point ◽  
Hamiltonian Path ◽  
Real Life ◽  
Tourism Industry ◽  
Orienteering Problem ◽  
Complete Graphs ◽  
Roulette Wheel Selection ◽  
Roulette Wheel

Orienteering problem (OP) is an NP-Hard graph problem. The nodes of the graph are associated with scores or rewards and the edges with time delays. The goal is to obtain a Hamiltonian path connecting the two necessary check points, i.e. the source and the target along with a set of control points such that the total collected score is maximized within a specified time limit. OP finds application in several fields like logistics, transportation networks, tourism industry, etc. Most of the existing algorithms for OP can only be applied on complete graphs that satisfy the triangle inequality. Real-life scenario does not guarantee that there exists a direct link between all control point pairs or the triangle inequality is satisfied. To provide a more practical solution, we propose a stochastic greedy algorithm (RWS_OP) that uses the roulette wheel selectionmethod, does not require that the triangle inequality condition is satisfied and is capable of handling both complete as well as incomplete graphs. Based on several experiments on standard benchmark data we show that RWS_OP is faster, more efficient in terms of time budget utilization and achieves a better performance in terms of the total collected score ascompared to a recently reported algorithm for incomplete graphs.

Graphic sequences and split graphs

2016 ◽  
Vol 32 (4) ◽  
pp. 1005-1014
Author(s):  
Jian-hua Yin ◽  
Lei Meng ◽  
Meng-Xiao Yin
Keyword(s):  
Split Graphs
Sign in / Sign up

Export Citation Format

Share Document