z-logo
open-access-imgOpen Access
An upper bound for the Laplacian index of a signed graph
Publication year - 2021
Publication title -
discrete mathematics letters
Language(s) - English
Resource type - Journals
ISSN - 2664-2557
DOI - 10.47443/dml.2020.0067
Subject(s) - index (typography) , mathematics , upper and lower bounds , graph , combinatorics , laplacian matrix , computer science , mathematical analysis , world wide web

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here