کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4598661 | 1631094 | 2016 | 19 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Polynomial reconstruction of signed graphs
ترجمه فارسی عنوان
بازسازی چندجملهای نمودارهای امضا شده
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
چکیده انگلیسی
The reconstruction problem of the characteristic polynomial of graphs from their polynomial decks was posed in 1973. So far this problem is not resolved except for some particular cases. Moreover, no counterexample for graphs of order n>2n>2 is known. Here we put forward the analogous problem for signed graphs, and besides some general results, we resolve it within signed trees and unicyclic signed graphs, and also within disconnected signed graphs whose one component is either a signed tree or is unicyclic. A family of counterexamples that was encountered in this paper consists of two signed cycles of the same order, one balanced and the other unbalanced.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 501, 15 July 2016, Pages 390–408
Journal: Linear Algebra and its Applications - Volume 501, 15 July 2016, Pages 390–408
نویسندگان
Slobodan K. Simić, Zoran Stanić,