The matching energy of graphs with given edge connectivity (Q903380): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59434016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results in the theory of graph spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to matching polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution to a conjecture on the maximal energy of bipartite bicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4903449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2856751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel inequalities for generalized graph entropies -- graph energies and topological indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture about tricyclic graphs with maximal energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tree with diameter 4 and maximal energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matching energy of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximal Matching Energy of Tricyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matching energy of graphs with given edge connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matching energy of graphs with given parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5280008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matching energy of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2975322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal matching energy of complements of trees / rank
 
Normal rank

Revision as of 06:37, 11 July 2024

scientific article
Language Label Description Also known as
English
The matching energy of graphs with given edge connectivity
scientific article

    Statements

    The matching energy of graphs with given edge connectivity (English)
    0 references
    0 references
    0 references
    0 references
    5 January 2016
    0 references
    matching energy
    0 references
    edge connectivity
    0 references
    graph energy
    0 references
    matching
    0 references
    extremal graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references