Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2510.23529

On generalized inverses of matrices associated with certain graph classes

Cláudia M. Araújo·Faustino A. Maciala·Pedro Patrício
View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate generalized inverses of matrices associated with two classes of digraphs: double star digraphs and D-linked stars digraphs. For double star digraphs, we determine the Drazin index and derive explicit formulas for the Drazin inverse. We also provide necessary and sufficient conditions for the existence of the Moore-Penrose inverse and give its explicit expression whenever it exists. For D-linked stars digraphs, we characterize when the group inverse exists and obtain its explicit form. In the singular case where BC = 0, we express the Drazin index of the matrix in terms of the Drazin index of the base digraph matrix. Additionally, we establish necessary and sufficient conditions for Moore--Penrose invertibility and derive explicit formulas in that case. Our results reveal a clear connection between the algebraic structure of generalized inverses and the combinatorial properties of these graph classes, providing a unified framework for group, Drazin, and Moore-Penrose invertibility.

Explore related subjects

math.COmath.RAmath.SP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cláudia M. Araújo, Faustino A. Maciala, Pedro Patrício. 2025-10-27. On generalized inverses of matrices associated with certain graph classes. https://arxiv.org/abs/2510.23529

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗