Further results on the star degree of graphs

DOI10.1016/J.AMC.2022.127076OpenAlexW4220995858MaRDI QIDQ2139789FDOQ2139789

Tingzeng Wu, Huazhong Lü, Tian Zhou

Publication date: 19 May 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.127076

zbMATH Keywords

permanentpermanental rootsignless Laplacian cospectralsignless Laplacian permanental spectrumstar degree

Mathematics Subject Classification ID

Graph polynomials (05C31) Determinants, permanents, traces, other special matrix functions (15A15) Structural characterization of families of graphs (05C75) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites Work

• Title not available (Why is that?)
• The complexity of computing the permanent
• Permanental roots and the star degree of a graph
• Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
• Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
• Multiplicity of integer roots of polynomials of graphs
• Computing the permanental polynomials of graphs
• On the (signless) Laplacian permanental polynomials of graphs
• The coefficients of the immanantal polynomial
• Highly unique network descriptors based on the roots of the permanental polynomial

Cited In (5)

• Some unicyclic graphs determined by the signless Laplacian permanental polynomial
• Title not available (Why is that?)
• On the roots of (signless) Laplacian permanental polynomials of graphs
• Ambarzumyan-type theorems on star graphs
• A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials

This page was built for publication: Further results on the star degree of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139789)