Paper Info
Title
Total Matching Numbers And Total Covering Numbers Of Complementary Graphs
Abstract
Best upper and lower bounds, as functions of n , are obtained for the quantities β 2 (G)+β 2 ( G ̄ ) and α 2 (G)+α 2 ( G ̄ ) , where β 2 ( G ) denotes the total matching number and α 2 ( G ) the total covering number of any graph G with n vertices and with complementry graph Ḡ . The best upper bound is obtained also for α 2 ( G )+ β 2 ( G ), when G is a connected graph.
Year
DOI
Venue
1977
10.1016/0012-365X(77)90102-9
DISCRETE MATHEMATICS
Field
DocType
Volume
Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Bound graph,Covering number,Upper and lower bounds,Connectivity,Mathematics
Journal
19
Issue
ISSN
Citations 
3
0012-365X
7
PageRank 
References 
Authors
0.60
2
2
Name
Order
Citations
PageRank
P Erdös1626190.85
A. Meir28050.32