Results 71 to 80 of about 87,339 (166)
DIMENSI METRIK PADA GRAF Rn(q; r)m
Jurnal Matematika UNAND, 2019 The metric dimension of a connected graph G is the cardinality of minimum resolving set in graph G. In this research, how to find the metric dimension of Rn(q; r)m graph. Rn(q; r)m graph is constructing by subdivision operation on Lobster graph Ln(q; r).
Rendy Aditya Pratama +2 more
doaj +1 more source
On the indices of certain graph products [PDF]
Transactions on CombinatoricsMolecular descriptors are numerical graph invariants that are used to study the chemical structure of molecules. In this paper, we determine the upper bound of the Sombor index based on four operations involving the subdivision graph, semi-total point ...
Ishita Sarkar, Manjunath Nanjappa
doaj +1 more source
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs
Journal of Mathematics, 2016 Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
doaj +1 more source
Excellent Domination Subdivision Stable Graphs
International Journal of Basic and Applied Sciences, 2012 Un conjunto de vértices D en un gráfico G = ( V, E ) es un conjunto dominante si cada vértice de V – D es adyacente a algún vértice de D. Si D tiene la cardinalidad más pequeña posible de cualquier conjunto dominante de G, entonces D se llama un conjunto dominante mínimo — abreviado MDS.
openaire +2 more sources
Distant Divisor Graph of Subdivision of a Graph
International Journal of Mathematics and Soft Computing, 2014 Let G = (V;E) be a (p; q) - graph. A shortest path P is called a distant divisor path if l(P) divides q. Distance divisor graphD(G) of a graph G = (V;E) has the vertex set V = V (G) and two vertices in D(G) are adjacent if they have the distant divisor path in G.
K. Nagarajan, Seenivasan Saravanakumar
openaire +1 more source
几个图运算下的图的惯性指数的界(Bounding the inertia of graphs under some graph operations)
Zhejiang Daxue xuebao. Lixue ban, 2016 The inertia of a graph G is defined to be the triple In(G) = {i+ (G), i- (G)，i0 (G)}，where i+ (G)，i-(G),i0 (G) are the numbers of positive,negative and zero eigenvalues of the adjacency matrix A(G) including multiplicities, respectively.
QUHui(曲慧), LIUWeijun(刘伟俊)
doaj +1 more source
More results on degree deviation and degree variance [PDF]
Journal of Mahani Mathematical ResearchThis paper investigates degree deviation and variance in graph theory, with a specific focus on $k$-regular graphs and subdivision of graphs. These metrics are fundamental for characterizing graph irregularity and have significant applications in ...
Mohsen Sayadi +2 more
doaj +1 more source
The Kirchhoff Index of Some Combinatorial Networks
Discrete Dynamics in Nature and Society, 2015 The Kirchhoff index Kf(G) is the sum of the effective resistance distances between all pairs of vertices in G. The hypercube Qn and the folded hypercube FQn are well known networks due to their perfect properties. The graph G∗, constructed from G, is the
Jia-Bao Liu +3 more
doaj +1 more source
A novel algebraic technique for adjacency matrices of some derived graphs
Mathematical and Computer Modelling of Dynamical SystemsGraph energy has been the main concern of spectral graph theory in the last five decades. The classical graph energy is the sum of the absolute values of the eigenvalues of the adjacency matrix. In many research papers, different versions of graph energy
Hacer Ozden Ayna +5 more
doaj +1 more source
Spectra of $(H_1,H_2)$-merged subdivision graph of a graph
, 2019 19 pages, 2 ...
Rajkumar, R., Gayathri, M.
openaire +2 more sources