Relations between parameters of a graph (Q802633): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary Graphs and Edge Chromatic Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Approach to a Communications Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicoloring the incidentors of a weighted directed multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some parameters of graph and its complement / rank
 
Normal rank

Latest revision as of 15:38, 21 June 2024

scientific article
Language Label Description Also known as
English
Relations between parameters of a graph
scientific article

    Statements

    Relations between parameters of a graph (English)
    0 references
    1991
    0 references
    The following parameters of graphs are studied here: the minimum degree, the connectivity, the edge connectivity, the maximum degree, the edge chromatic number, the vertex chromatic number, the achromatic number, the clique number, the covering number, the edge independence number, the length of the longest path and the circumference, as well as the girth, the diameter, the edge covering number, the independence number and the domination number. The author also lists the relations between any two of these parameters in a table.
    0 references
    0 references
    parameters of graphs
    0 references
    0 references

    Identifiers