Results 101 to 110 of about 2,717 (193)
On Sombor index and graph energy of some chemically important graphs
Examples and CounterexamplesSombor index of a graph G=(V(G),E(G)) is provided by the expression ∑uv∈E(G)du2+dv2, where dx is the degree of the vertex x∈V(G). The energy of a graph is the quantity given by the total of the absolute values of its adjacency matrix’s eigenvalues.
Md Selim Reja, Sk. Md. Abu Nayeem
doaj +1 more source
On Wiener index of graph complements [PDF]
Transactions on Combinatorics, 2014 Let $G$ be an $(n,m)$-graph. We say that $G$ has property $(ast)$ if for every pair of its adjacent vertices $x$ and $y$, there exists a vertex $z$, such that $z$ is not adjacent to either $x$ or $y$.
Jaisankar Senbagamalar +2 more
doaj
Reconstructing edge-deleted unicyclic graphs
The Harary reconstruction conjecture states that any graph with more than four edges can be uniquely reconstructed from its set of maximal edge-deleted subgraphs. In 1977, Müller verified the conjecture for graphs with $n$ vertices and $n \log_2(n)$ edges, improving on Lovás's bound of $\log(n^2-n)/4$.
Pizzimenti, Anthony E. +1 more
openaire +2 more sources
Hosoya Polynomials of Power Graphs of Certain Finite Groups. [PDF]
Molecules, 2022 Rather BA, Ali F, Alsaeed S, Naeem M.
europepmc +1 more source
On Hamiltonian Decomposition Problem of 3-Arc Graphs. [PDF]
Comput Intell Neurosci, 2022 Xu G, Sun Q, Liang Z.
europepmc +1 more source
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
Open MathematicsThe number of jj-matchings in a graph HH is denote by m(H,j)m\left(H,j). If for two graphs H1{H}_{1} and H2{H}_{2}, m(H1,j)≥m(H2,j)m\left({H}_{1},j)\ge m\left({H}_{2},j) for all jj, then we write H1≽H2{H}_{1}\succcurlyeq {H}_{2}.
Bai Yongqiang, Ma Hongping, Zhang Xia
doaj +1 more source
High-ordered spectral characterization of unicyclic graphs
Discussiones Mathematicae Graph TheoryIn 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$. The spectrum of $G$ is referring to its adjacency matrix, and the spectrum of $G^m$ is referring to its adjacency tensor. The graph $G$ is called determined by high-
Yi-Zheng Fan, Hong-Xia Yang, Jian Zheng
openaire +3 more sources
Planar packing of cycles and unicyclic graphs
Demonstratio Mathematica, 2009 AbstractWe say that a graphIn this paper we show that for any packable ...
openaire +1 more source
On detour index of cycloparaphenylene and polyphenylene molecular structures. [PDF]
Sci Rep, 2021 Prabhu S +4 more
europepmc +1 more source
Power Graphs of Finite Groups Determined by Hosoya Properties. [PDF]
Entropy (Basel), 2022 Ali F +4 more
europepmc +1 more source