Results 101 to 110 of about 580,793 (206)
Independence and matching numbers of unicyclic graphs from null space [PDF]
, 2020 We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its subtrees ...
Molina, Gonzalo +4 more
core +1 more source
Induced Geodetic Sequence of a Graph [PDF]
Transactions on CombinatoricsA vertex subset $S$ of a graph $G=(V,E)$ is said to be a geodetic set if every vertex in $G$ is in some $u-v$ geodesic for any $u,v \in S$. The minimum cardinality of such a set is the geodetic number, which is denoted as $g(G)$.
Liju Olickal, John Mulloor
doaj +1 more source
Degree distance of unicyclic and bicyclic graphs
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksandar Ilic +4 more
openaire +1 more source
Resistance matrix and q-Laplacian of a unicyclic graph
, 2008 : The resistance distance between two vertices of a graph can be defined as the effective resistance between the two vertices, when the graph is viewed as an electrical network with each edge carrying unit resistance.
R. B. Bapat
core
The determinant of a unicyclic graph’s neighborhood matrix
Linear Algebra and its Applications, 2005 Let \(G\) be a unicyclic graph with \(n\) vertices and a unique cycle, \(A(G)\) denotes the adjacency matrix of the graph \(G\). The algorithm for computing the determinant function of the matrix \(\alpha I_n+A(G)\) which uses \(O(n)\) arithmetic operations under some restrictions on the degrees of the vertices of the graph \(G\) is obtained. Among the
openaire +2 more sources
Regularity of Powers of Unicyclic Graphs [PDF]
, 2018 Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. In this paper we prove that if $G$ is a unicyclic graph then for all $s \geq 1$ the regularity of $I(G)^s$ is exactly $2s+\text{reg}(I(G))-2$.
Alilooee, Ali +2 more
core +1 more source
Solutions of Detour Distance Graph Equations. [PDF]
Sensors (Basel), 2022 Prabha SC +7 more
europepmc +1 more source
Spectrum of Unicyclic Graph [PDF]
Advances in Computer Science Research, 2022 Agung Lukito +3 more
openaire +1 more source
The inertia of unicyclic graphs and bicyclic graphs
Discussiones Mathematicae - General Algebra and Applications, 2013 Let G be a graph with n vertices and (G) be the matching number of G. The inertia of a graph G, In(G) = (n+;n ;n0) is an integer triple specifying the numbers of positive, negative and zero eigenvalues of the adjacency matrix A(G), respectively. Let (G) = n0 denote the nullity of G (the multiplicity of the eigenvalue zero of G).
openaire +1 more source
Locating eigenvalues of unicyclic graphs
, 2017 We present a linear time algorithm that computes the number of eigenvalues of a unicyclic graph in a given real interval. It operates directly on the graph, so that the matrix is not needed explicitly.
Virgínia Rodrigues +2 more
core +1 more source