Results 11 to 20 of about 157 (86)
Under which conditions is λ″(G)=κ″(L(G))?
AKCE International Journal of Graphs and Combinatorics, 2023 In this paper we show that if G is a connected graph such that [Formula: see text], [Formula: see text] and [Formula: see text] then [Formula: see text] exists and [Formula: see text] if and only if G is not super-[Formula: see text]. We also obtain some
Farnaz Soliemany +2 more
doaj +1 more source
On the Two-Dimensional Version of the Sperner Lemma and Brouwer’s Theorem
Annales Mathematicae Silesianae, 2022 In this work the Brouwer fixed point theorem for a triangle was proved by two methods based on the Sperner Lemma. One of the two proofs of Sperner’s Lemma given in the paper was carried out using the so-called index.
Barcz Eugeniusz
doaj +1 more source
Some Characteristics of the Prime Graph of Integer Modulo Groups
InPrime, 2023 The notion of the prime graph of a ring R was first introduced by Bhavanari, Kuncham, and Dasari in 2010. The prime graph of a ring R, denoted by PG(R) is a graph whose vertices are all elements of the ring, where two distinct vertices x and y are ...
Muklas Maulana +3 more
doaj +1 more source
Classification of Filiform Lie Algebras up to dimension 7 Over Finite Fields
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 This paper tries to develop a recent research which consists in using Discrete Mathematics as a tool in the study of the problem of the classification of Lie algebras in general, dealing in this case with filiform Lie algebras up to dimension 7 over ...
Falcón Óscar J. +4 more
doaj +1 more source
The agreement distance of unrooted phylogenetic networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A rearrangement operation makes a small graph-theoretical change to a phylogenetic network to transform it into another one. For unrooted phylogenetic trees and networks, popular rearrangement operations are tree bisection and reconnection (TBR) and ...
Jonathan Klawitter
doaj +1 more source
The multiplicative Zagreb indices of graph operations
, 2013 Recently, Todeschini et al. (Novel Molecular Structure Descriptors - Theory and Applications I, pp. 73-100, 2010), Todeschini and Consonni (MATCH Commun. Math. Comput. Chem.
K. Das +4 more
semanticscholar +1 more source
The Generalized Zagreb Index of Capra-Designed Planar Benzenoid Series $Ca_k(C_6)$
, 2017 Let G = (V,E) be a simple connected graph. The sets of vertices and edges of G are denoted by V = V (G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms and edges represent bonds.
M. S. Sardar, Sohail Zafar, M. Farahani
semanticscholar +1 more source
A shorter proof of the distance energy of complete multipartite graphs
Special Matrices, 2017 Caporossi, Chasser and Furtula in [Les Cahiers du GERAD (2009) G-2009-64] conjectured that the distance energy of a complete multipartite graph of order n with r ≥ 2 parts, each of size at least 2, is equal to 4(n − r).
So Wasin
doaj +1 more source
InPrime, 2023 Nowadays, a trademark is starting to be built through content on social media by involving influencers whose roles are increasingly needed in digital marketing. Hence, finding them on social media networks is an important thing. In brand recognition, BTS
Siti Adniati +2 more
doaj +1 more source
Computing topological indices of Hex Board and its line graph
, 2017 A topological index is a real number related to a molecular graph, which is a graph invariant. Uptill now there are several topological indices are defined.
Hafiz Mutee ur Rehman +2 more
semanticscholar +1 more source