Some parameters of graph and its complement (Q1094434): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Shao-Ji Xu / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: S. F. Kapoor / rank
Normal rank
 
Property / author
 
Property / author: Shao-Ji Xu / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: S. F. Kapoor / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary Graphs and Edge Chromatic Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: Parallel concepts in graph theory / 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: Multicoloring the incidentors of a weighted directed multigraph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:14, 18 June 2024

scientific article
Language Label Description Also known as
English
Some parameters of graph and its complement
scientific article

    Statements

    Some parameters of graph and its complement (English)
    0 references
    1987
    0 references
    The paper presents inequalities of the Nordhaus-Gaddum type for the diameter d, girth g, circumference c, and edge covering number \(\beta_ 1\) of a graph G.
    0 references
    inequalities
    0 references
    Nordhaus-Gaddum type
    0 references
    diameter
    0 references
    girth
    0 references
    circumference
    0 references
    edge covering
    0 references
    0 references
    0 references

    Identifiers