Results 41 to 50 of about 530 (118)
On the inducibility of small trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The quantity that captures the asymptotic value of the maximum number of appearances of a given topological tree (a rooted tree with no vertices of outdegree $1$) $S$ with $k$ leaves in an arbitrary tree with sufficiently large number of leaves is called
Audace A. V. Dossou-Olory +1 more
doaj +1 more source
Making multigraphs simple by a sequence of double edge swaps
, 2021 We show that any loopy multigraph with a graphical degree sequence can be transformed into a simple graph by a finite sequence of double edge swaps with each swap involving at least one loop or multiple edge.
Sjöstrand, Jonas
core
On General Sum‐Connectivity Index and Number of Segments of Fixed‐Order Chemical Trees
Journal of Mathematics, Volume 2025, Issue 1, 2025.Nowadays, one of the most active areas in mathematical chemistry is the study of the mathematical characteristics associated with molecular descriptors. The primary objective of the current study is to find the largest value of χα of graphs in the class of all fixed‐order chemical trees with a particular number of segments for α > 1, where χα is the ...
Muzamil Hanif +5 more
wiley +1 more source
On First Hermitian-Zagreb Matrix and Hermitian-Zagreb Energy
International Journal of Scientific Research in Mathematical and Statistical Sciences, 2018 A mixed graph is a graph with edges and arcs, which can be considered as a combination of an undirected graph and a directed graph. In this paper we propose a Hermitian matrix for mixed graphs which is a modified version of the classical adjacency matrix
A. Bharali
semanticscholar +1 more source
Trees with the most subtrees -- an algorithmic approach
, 2012 When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in applications.
Gray, Daniel +3 more
core +1 more source
Journal of Mathematics, Volume 2025, Issue 1, 2025.The multiplicative sum Zagreb index of a graph G is defined as the product of the sum of the degrees of adjacent vertices of G. A molecular tree is an acyclic connected graph with maximum degree at most 4. A vertex in a molecular tree with degree 3 or 4 is referred to as a branching vertex. In this paper, we consider the class of all molecular trees of
Sadia Noureen +6 more
wiley +1 more source
Degree Subtraction Adjacency Eigenvalues and Energy of Graphs Obtained From Regular Graphs
Open Journal of Discrete Applied Mathematics, 2018 Let V (G) = {v1, v2, . . . , vn} be the vertex set of G and let dG(vi) be the degree of a vertex vi in G. The degree subtraction adjacency matrix of G is a square matrix DSA(G) = [dij ], in which dij = dG(vi) − dG(vj), if vi is adjacent to vj and dij = 0,
H. Ramane, Hemaraddi N. Maraddi
semanticscholar +1 more source
A Study on Edge-Set Graphs of Certain Graphs
, 2015 Let $G(V, E)$ be a simple connected graph, with $|E| = \epsilon.$ In this paper, we define an edge-set graph $\mathcal G_G$ constructed from the graph $G$ such that any vertex $v_{s,i}$ of $\mathcal G_G$ corresponds to the $i$-th $s$-element subset of $E(
Chithra, K. P., Kok, Johan, Sudev, N. K.
core +2 more sources
ON TOPOLOGICAL PROPERTIES OF PLANE GRAPHS BY USING LINE OPERATOR ON THEIR SUBDIVISIONS
International Journal of Apllied Mathematics, 2018 In this paper, we will compute some topological indices such as Zagreb indices M1(G), M2(G), M3(G), Zagreb coindices M1(G), M1(G), M2(G), M2(G)), M2(G), hyper-Zagreb index HM(G), atom-bond connectivity index ABC(G), sum connectivity index χ(G ...
Mohamad Nazri Husin +4 more
semanticscholar +1 more source
A Tur\'an-type problem on degree sequence [PDF]
, 2013 Given $p\geq 0$ and a graph $G$ whose degree sequence is $d_1,d_2,\ldots,d_n$, let $e_p(G)=\sum_{i=1}^n d_i^p$. Caro and Yuster introduced a Tur\'an-type problem for $e_p(G)$: given $p\geq 0$, how large can $e_p(G)$ be if $G$ has no subgraph of a ...
Li, Xueliang, Shi, Yongtang
core