The neighbour-scattering number can be computed in polynomial time for interval graphs

Authors:
Fengwei Li;Xueliang Li
Affiliations:
Centre for Combinatorics and LPMC, Nankai University, Tianjin 300071, PR China;Centre for Combinatorics and LPMC, Nankai University, Tianjin 300071, PR China
Venue:
Computers & Mathematics with Applications
Year:
2007

Citing 4
Cited 0

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Graph Theory With Applications

Graph Theory With Applications
Computational complexity and bounds for neighbor-scattering number of graphs

ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.09

Visualization

Abstract

The object of the present paper is to investigate some inclusion relationships and a number of other useful properties of several subclasses of multivalent analytic functions, which are defined here by using the Dziok-Srivastava operator. Relevant connections ...