"Proof of conjectures involving the largest and the smallest signless ..."

Kinkar Chandra Das (2012)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2011.10.030

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/Das12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Das12
Kinkar Chandra Das:
Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs. Discret. Math. 312(5): 992-998 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.