A PHP Error was encountered

Severity: Warning

Message: file_get_contents(https://...@pubfacts.com&api_key=b8daa3ad693db53b1410957c26c9a51b4908&a=1): Failed to open stream: HTTP request failed! HTTP/1.1 429 Too Many Requests

Filename: helpers/my_audit_helper.php

Line Number: 176

Backtrace:

File: /var/www/html/application/helpers/my_audit_helper.php
Line: 176
Function: file_get_contents

File: /var/www/html/application/helpers/my_audit_helper.php
Line: 250
Function: simplexml_load_file_from_url

File: /var/www/html/application/helpers/my_audit_helper.php
Line: 3122
Function: getPubMedXML

File: /var/www/html/application/controllers/Detail.php
Line: 575
Function: pubMedSearch_Global

File: /var/www/html/application/controllers/Detail.php
Line: 489
Function: pubMedGetRelatedKeyword

File: /var/www/html/index.php
Line: 316
Function: require_once

On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree. | LitMetric

On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree.

J Inequal Appl

School of Mathematics and Statistics, Yancheng Teachers University, Yancheng, Jiangsu 224002 P.R. China.

Published: May 2017

In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order with maximum degree Δ and among all non-bipartite connected graphs of order with maximum degree Δ, respectively.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC5440539PMC
http://dx.doi.org/10.1186/s13660-017-1395-yDOI Listing

Publication Analysis

Top Keywords

maximum degree
12
signless laplacian
8
laplacian eigenvalue
8
non-bipartite connected
8
graphs order
8
order maximum
8
eigenvalue non-bipartite
4
connected graph
4
graph fixed
4
fixed maximum
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!