Results 61 to 70 of about 6,957 (218)
Zagreb Indices of Trees, Unicyclic and Bicyclic Graphs With Given (Total) Domination
IEEE Access, 2019 Let G = (V, E) be a (molecular) graph. For a family of graphs G, the first Zagreb index M1 and the second Zagreb index M2 have already studied. In particular, it has been presented, the first Zagreb index M1 and the second Zagreb index M2 of trees T in ...
Doost Ali Mojdeh +3 more
doaj +1 more source
Non-regular graphs with minimal total irregularity
, 2014 The {\it total irregularity} of a simple undirected graph $G$ is defined as ${\rm irr}_t(G) =$ $\frac{1}{2}\sum_{u,v \in V(G)}$ $\left| d_G(u)-d_G(v) \right|$, where $d_G(u)$ denotes the degree of a vertex $u \in V(G)$.
Abdo, Hosam, Dimitrov, Darko
core +1 more source
CAAI Transactions on Intelligence Technology, EarlyView.Abstract In intelligent transportation systems, object detection for a surveillance video is one of the important functions. The performance of existing surveillance video object detection algorithms is affected by the conflict between the features of the objects, which leads to a decline in precision.
Yang He +5 more
wiley +1 more source
Extremal Bicyclic Graphs with Respect to Permanental Sums and Hosoya Indices
AxiomsGraph polynomials is one of the important research directions in mathematical chemistry. The coefficients of some graph polynomials, such as matching polynomial and permanental polynomial, are related to structural properties of graphs.
Tingzeng Wu, Yinggang Bai, Shoujun Xu
doaj +1 more source
On the Inverse Problem for Some Topological Indices
Journal of Mathematics, 2021 The study of the inverse problem (IP) based on the topological indices (TIs) deals with the numerical relations to TIs. Mathematically, the IP can be expressed as follows: given a graph parameter/TI that assigns a non-negative integer value g to every ...
Durbar Maji +3 more
doaj +1 more source
Bicyclic graphs with exactly two main signless Laplacian eigenvalues [PDF]
, 2013 A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero.
Deng, Hanyuan, Huang, He
core
On the nullity of bicyclic graphs
Linear Algebra and its Applications, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Shengbiao +2 more
openaire +2 more sources
A Conversation With David Bellhouse
International Statistical Review, EarlyView.Summary David Richard Bellhouse was born in Winnipeg, Manitoba, on 19 July 1948. He studied actuarial mathematics and statistics at the University of Manitoba (BA, 1970; MA, 1972) and completed his PhD at the University of Waterloo, Ontario, in 1975. After being an Assistant Professor for 1 year at his alma mater, he joined the University of Western ...
Christian Genest
wiley +1 more source
On minimum revised edge Szeged index of bicyclic graphs
AKCE International Journal of Graphs and Combinatorics, 2022 The revised edge Szeged index [Formula: see text] of a graph G is defined as [Formula: see text] where [Formula: see text] and [Formula: see text] are, respectively, the number of edges of G lying closer to vertex u than to vertex v and the number of ...
Mengmeng Liu, Shengjin Ji
doaj +1 more source
On a conjecture about tricyclic graphs with maximal energy [PDF]
, 2014 For a given simple graph $G$, the energy of $G$, denoted by $\mathcal {E}(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix, which was defined by I. Gutman. The problem on determining the maximal energy tends to
Li, Jing +3 more
core +1 more source