Arithmetical structures on graphs with connectivity one

DOI10.1142/S0219498818501475MaRDI QIDQ3177311zbMATH OpenFDO

Authors Hugo Corrales, Carlos Valencia

Publication date 31 July 2018

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1606.03726

zbMATH Keywords

Laplacian matrixcut vertexM-matricesarithmetical graphsarithmetical structure2-connected componentsconnectivity one

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Matrices, determinants in number theory (11C20) Matrices of integers (15B36) Connectivity (05C40) Diophantine equations in many variables (11D72)

Abstract: Given a graph $G$, an arithmetical structure on $G$ is a pair of positive integer vectors $$ such that $$ and [ (mathrm{diag}({�f d})-A){�f r}=0, ] where $A$ is the adjacency matrix of $G$. We describe the arithmetical structures on graph $G$ with a cut vertex $v$ in terms of the arithmetical structures on their blocks. More precisely, if $G_1,ldots,G_s$ are the induced subgraphs of $G$ obtained from each of the connected components of $G-v$ by adding the vertex $v$ and their incident edges, then the arithmetical structures on $G$ are in one to one correspondence with the $v$-rational arithmetical structures on the $G_i$'s. We introduce the concept of rational arithmetical structure, which corresponds to an arithmetical structure where some of the integrality conditions are relaxed.

Recommendations

• Arithmetical structures on graphs
• On arithmetical structures on complete graphs
• Bounding the number of arithmetical structures on graphs
• On arithmetic graphs
• scientific article; zbMATH DE number 1225797
• On arithmetic infinite graphs
• Arithmetical topics in algebraic graph theory
• scientific article; zbMATH DE number 465440
• scientific article; zbMATH DE number 991607
• scientific article; zbMATH DE number 4200313

Cites work

• Algebraic Potential Theory on Graphs
• Arithmetical graphs
• Arithmetical structures on graphs
• Chip-firing and energy minimization on M-matrices
• Chromatic number and the 2-rank of a graph
• Counting arithmetical structures on paths and cycles
• On the critical ideals of graphs
• Reduction of points in the group of components of the Néron model of a jacobian

Cited in

(8)

• Arithmetical structures on graphs
• Arithmetical structures on dominated polynomials
• Algorithmic aspects of arithmetical structures
• The extremal spectral radii of the arithmetical structures on paths
• Arithmetical structures on bidents
• Spectral radii of arithmetical structures on cycle graphs
• Chip-firing games and critical groups
• Arithmetical structures on paths with a doubled edge

This page was built for publication: Arithmetical structures on graphs with connectivity one

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