A note on connected bipartite graphs of fixed order and size with maximal index (Q490874): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Miroslav M. Petrović / rank
Normal rank
 
Property / author
 
Property / author: Slobodan K. Simic / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C50 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6474801 / rank
 
Normal rank
Property / zbMATH Keywords
 
adjacency matrix
Property / zbMATH Keywords: adjacency matrix / rank
 
Normal rank
Property / zbMATH Keywords
 
graph spectrum
Property / zbMATH Keywords: graph spectrum / rank
 
Normal rank
Property / zbMATH Keywords
 
largest eigenvalue
Property / zbMATH Keywords: largest eigenvalue / rank
 
Normal rank
Property / zbMATH Keywords
 
double nested graphs
Property / zbMATH Keywords: double nested graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
bipartite chain graphs
Property / zbMATH Keywords: bipartite chain graphs / rank
 
Normal rank
Property / author
 
Property / author: Miroslav M. Petrović / rank
 
Normal rank
Property / author
 
Property / author: Slobodan K. Simic / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2015.05.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W574656419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new considerations about double nested graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounds for the index of double nested graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs for which the least eigenvalue is minimal. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs for which the least eigenvalue is minimal. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the first eigenvalue of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the largest eigenvalues of bipartite graphs which are nearly complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3642517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the least eigenvalue of graphs with fixed order and size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further results on the least eigenvalue of connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicyclic graphs for which the least eigenvalue is minimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal index of graphs with a prescribed number of edges / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:56, 10 July 2024

scientific article
Language Label Description Also known as
English
A note on connected bipartite graphs of fixed order and size with maximal index
scientific article

    Statements

    A note on connected bipartite graphs of fixed order and size with maximal index (English)
    0 references
    21 August 2015
    0 references
    0 references
    adjacency matrix
    0 references
    graph spectrum
    0 references
    largest eigenvalue
    0 references
    double nested graphs
    0 references
    bipartite chain graphs
    0 references
    0 references
    0 references
    0 references