Results 41 to 50 of about 828 (207)
ALGORITHMIC ASPECTS OF ROMAN GRAPHS [PDF]
Journal of Algebraic Systems, 2021 Let $G=(V, E)$ be a graph. A set $S \subseteq V$ is called a dominating set of $G$ if for every $v\in V-S$ there is at least one vertex $u \in N(v)$ such that $u\in S$.
A. Poureidi
doaj +1 more source
Unicyclic graphs with bicyclic inverses [PDF]
, 2017 A graph is nonsingular if its adjacency matrix A(G) is nonsingular. The inverse of a nonsingular graph G is a graph whose adjacency matrix is similar to A(G)−1 via a particular type of similarity. Let H denote the class of connected bipartite graphs with
Swarup Kumar Panda, Panda, Swarup Kumar
core +2 more sources
Minor-obstructions for apex sub-unicyclic graphs
, 2020 International audienceA graph is {\em sub-unicyclic} if it contains at most one cycle. A graph $G$ is {\em $k$-apex sub-unicyclic} if it can become sub-unicyclic by removing $k$ of its vertices.
Velona, Vasiliki +5 more
core +2 more sources
Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue
Journal of Inequalities and Applications, 2016 A unicyclic graph is a connected graph whose number of edges is equal to the number of vertices. Fan et al. (Discrete Math. 313:903-909, 2013) and Liu et al. (Electron. J.
Shu-Guang Guo +3 more
doaj +1 more source
On the core of a unicyclic graph
Ars Mathematica Contemporanea, 2012 8 pages, 5 ...
Vadim E. Levit, Eugen Mandrescu
openaire +3 more sources
The local metric dimension of split and unicyclic graphs
Indonesian Journal of Combinatorics, 2022 A set W is called a local resolving set of G if the distance of u and v to some elements of W are distinct for every two adjacent vertices u and v in G. The local metric dimension of G is the minimum cardinality of a local resolving set of G.
Dinny Fitriani +3 more
doaj +1 more source
The spread of the unicyclic graphs
European Journal of Combinatorics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yarong Wu, Jinlong Shu
openaire +2 more sources
On the first and second Zagreb indices of quasi unicyclic graphs [PDF]
Transactions on Combinatorics, 2019 Let $G$ be a simple graph. The graph $G$ is called a quasi unicyclic graph if there exists a vertex $x \in V(G)$ such that $G-x$ is a connected graph with a unique cycle. Moreover, the first and the second Zagreb indices of $G$ denoted by $M_1(G)$
Majid Aghel +2 more
doaj +1 more source
Journal of Mathematics, 2022 The matching roots of a simple connected graph G are the roots of the matching polynomial which is defined as MGx=∑k=0n/2−1kmG,kxn−2k, where mG,k is the number of the k matchings of G. Let λ1G denote the largest matching root of the graph G.
Luozhong Gong, Weijun Liu
doaj +1 more source
High-ordered spectral characterization of unicyclic graphs
, 2022 In this paper we will apply the tensor and its traces to investigate the spectral characterization of unicyclic graphs. Let $G$ be a graph and $G^m$ be the $m$-th power (hypergraph) of $G$.
Fan, Yi-Zheng +2 more
core +2 more sources