COUNTING PATHS OF GRAPHS VIA INCIDENCE MATRICES-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

COUNTING PATHS OF GRAPHS VIA INCIDENCE MATRICES

Published:2024-06-06 Issue:1 Volume:16 Page:57-76
ISSN:2066-5997
Container-title:Annals of the Academy of Romanian Scientists Series on Mathematics and Its Application
language:
Short-container-title:AnnalsARSciMath

Author:

,Imbesi Maurizio,La Barbiera Monica,

Abstract

Operating only by means of the incidence matrix of a connected graph G, a new algebraic combinatorial method for determining the paths of length (q−1) of G together with the generators of the corresponding generalized graph ideal Iq(G) is discussed and developed. The stated formulae are obtained and shown even by changing techniques appropriately when the difficulties of calculation increased.

Publisher

Academia Oamenilor de Stiinta din Romania

Reference7 articles.

1. [1] F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1994.

2. [2] M. Imbesi. Incidence matrix of some classes of graphs. Quaderni Sez. Alg. Geom. Storia e Fond., Ser. I, Messina, 2003.

3. [3] M. Imbesi, M. La Barbiera. On algebraic properties of Veronese bi-type ideals arising from graphs. Turk. J. Math. 40,4:753-765, 2016.

4. [4] M. Imbesi, M. La Barbiera, P.L. Stagliano. On generalized graph ideals of complete bipartite graphs. J. Ramanujan Math. Soc. 32,2:121-133, 2017.

5. [5] M. La Barbiera, P.L. Stagliano. Generalized graph ideals of linear type. Algebr. Colloq. 24,1:83-91, 2017.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP