Results 41 to 50 of about 504 (100)
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
The upper bounds for multiplicative sum Zagreb index of some graph operations
, 2017 Let G be a simple graph with vertex set V(G) and edge set E(G). In [7], Eliasi et al. introduced the multiplicative sum Zagreb index of a graph G which is denoted by Π1(G) and is defined by Π1(G) = ∏ uv∈V (G) (dG(u)+dG(v)) .
Yasar Nacaroglu, A. D. Maden
semanticscholar +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
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
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
Symmetric Bipartite Graphs and Graphs with Loops
, 2014 We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges its two parts.
Cairns, Grant, Mendan, Stacey
core +3 more sources
Bounds for Laplacian-type graph energies
, 2015 Let G be an undirected simple and connected graph with n vertices .n 3/ and m edges. Denote by 1 2 n 1 > n D 0, 1 2 n , and 1 2 n 1 > n D 0 , respectively, the Laplacian, signless Laplacian, and normalized Laplacian eigenvalues of G. The Laplacian energy,
I. Gutman +2 more
semanticscholar +1 more source
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 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
The harmonic index for unicyclic and bicyclic graphs with given matching number
, 2015 The harmonic index of a graph G is defined as the sum of the weights 2 d.u/Cd.v/ of all edges uv of G, where d.u/ denotes the degree of a vertex u in G.
Lingping Zhong
semanticscholar +1 more source