Degree sum adjacency polynomial of standard graphs and graph operations

<span>In this paper we explore the characteristic polynomials of degree sum adjacency matrix </span><span class="math inline"><em>D</em><em>S</em>_<em>A</em>(<em>G</em>)</span><span> of a simple undirected graph </span><span class="math inline"><em>G</em></span><span>. We state a relation...

תיאור מלא

מידע ביבליוגרפי

Principais autores:	S S Shinde, H S Ramane, S B Gudimani, N Swamy
פורמט:	Artigo
שפה:	Inglês
יצא לאור:	Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2022-03-01
סדרה:	Electronic Journal of Graph Theory and Applications
נושאים:	degree sum adjacency matrix, degree sum adjacency polynomial, number of walks.
גישה מקוונת:	http://www.ejgta.org/index.php/ejgta/article/view/1129
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!