Results 31 to 40 of about 3,013 (185)
A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs [PDF]
, 2014 The \emph{zero forcing number}, $Z(G)$, of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G)-S$ are colored white) such that $V(G)$ is turned black after finitely many applications of "the color-change rule":
A Sebö +19 more
core +1 more source
Some algebraic invariants of the edge ideals of perfect [h,d]-ary trees and some unicyclic graphs
AIMS Mathematics, 2023 This article is mainly concerned with computations of some algebraic invariants of quotient rings of edge ideals of perfect [h,d]-ary trees and unicyclic graphs. We compute exact values of depth and Stanley depth and consequently projective dimension for
Tazeen Ayesha, Muhammad Ishaq
doaj +1 more source
The Aα-spectral radius of complements of bicyclic and tricyclic graphs with n vertices
Special Matrices, 2021 Recently, the extremal problem of the spectral radius in the class of complements of trees, unicyclic graphs, bicyclic graphs and tricyclic graphs had been studied widely.
Chen Chaohui +2 more
doaj +1 more source
Spanning trees and even integer eigenvalues of graphs [PDF]
, 2014 For a graph $G$, let $L(G)$ and $Q(G)$ be the Laplacian and signless Laplacian matrices of $G$, respectively, and $\tau(G)$ be the number of spanning trees of $G$.
Ghorbani, Ebrahim
core +1 more source
On Minimum Wiener Polarity Index of Unicyclic Graphs with Prescribed Maximum Degree
Journal of Applied Mathematics, 2014 The Wiener polarity index of a connected graph G is defined as the number of its pairs of vertices that are at distance three. By introducing some graph transformations, in different way with that of Huang et al., 2013, we determine the minimum Wiener ...
Jianping Ou, Xing Feng, Saihua Liu
doaj +1 more source
On the Maximum Sombor Index of Unicyclic Graphs with a Fixed Girth
Journal of Mathematics, 2022 Let G be a graph having the set of edges EG. Represent by dGu the degree of a vertex u of G. The Sombor (SO) index of G is defined as SOG=∑uv∈EGdGu2+dGv2. The length of a shortest cycle in a graph G is known as the girth of G.
B. Senthilkumar +5 more
doaj +1 more source
All unicyclic graphs of order n with locating-chromatic number n-3
Indonesian Journal of Combinatorics, 2021 Characterizing all graphs having a certain locating-chromatic number is not an easy task. In this paper, we are going to pay attention on finding all unicyclic graphs of order n (⩾ 6) and having locating-chromatic number n-3.
Edy Tri Baskoro, Arfin Arfin
doaj +1 more source
Maximizing spectral radii of uniform hypergraphs with few edges
, 2015 In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs ...
Fan, Yi-Zheng +3 more
core +1 more source
On Unicyclic Graphs Spectra: New Results
2016 IEEE Intl Conference on Computational Science and Engineering (CSE) and IEEE Intl Conference on Embedded and Ubiquitous Computing (EUC) and 15th Intl Symposium on Distributed Computing and Applications for Business Engineering (DCABES), 2016 Let G = (V, E) be a unicyclic simple undirected graph. In this paper, we investigate the spectra of a particular class of unicyclic graphs G(q, n1) where q is the size of the unique cycle. Each vertex of the unique cycle is attached to n1 vertices. We provide the " exact values " of the extremal eigenvalues of the adjacency matrix A and the Laplacian ...
Hadji, Makhlouf, Chau, Ming
openaire +1 more source
A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs
, 2017 The \emph{metric dimension} $\dim(G)$ of a graph $G$ is the minimum number of vertices such that every vertex of $G$ is uniquely determined by its vector of distances to the chosen vertices.
Eroh, Linda, Kang, Cong X., Yi, Eunjeong
core +1 more source