Results 61 to 70 of about 31,664 (169)
First reformulated Zagreb indices of some classes of graphs
Karpatsʹkì Matematičnì Publìkacìï, 2018 A topological index of a graph is a parameter related to the graph; it does not depend on labeling or pictorial representation of the graph. Graph operations plays a vital role to analyze the structure and properties of a large graph which is derived ...
V. Kaladevi +2 more
doaj +1 more source
The median of Sierpiński triangle graphs
Discrete Applied MathematicsThe median $M$ of a graph $G$ is the set of vertices with a minimum total distance to all other vertices in the graph. In this paper, we determine the median of Sierpiński triangle graphs. Sierpiński triangle graphs, also known as Sierpiński gasket graphs of order $n$ are graphs formed by contracting all non-clique edges from the Sierpiński graphs of ...
Kannan Balakrishnan +5 more
openaire +2 more sources
On equality in an upper bound for the acyclic domination number [PDF]
Opuscula Mathematica, 2008 A subset \(A\) of vertices in a graph \(G\) is acyclic if the subgraph it induces contains no cycles. The acyclic domination number \(\gamma_a(G)\) of a graph \(G\) is the minimum cardinality of an acyclic dominating set of \(G\).
Vladimir Samodivkin
doaj
An analytic approach to sparse hypergraphs: hypergraph removal
Discrete Analysis, 2018 An analytic approach to sparse hypergraphs: hypergraph removal, Discrete Analysis 2018:3, 47 pp. The famous triangle removal lemma of Ruzsa and Szemerédi states that for every $\epsilon>0$ there exists $\delta>0$ such that every graph $G$ on $n ...
Henry Towsner
doaj +1 more source
Divisibility Patterns within Pascal Divisibility Networks
Mathematics, 2020 The Pascal triangle is so simple and rich that it has always attracted the interest of professional and amateur mathematicians. Their coefficients satisfy a myriad of properties.
Pedro A. Solares-Hernández +3 more
doaj +1 more source
The hyperbolicity constant of infinite circulant graphs
Open Mathematics, 2017 If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X.
Rodríguez José M., Sigarreta José M.
doaj +1 more source
Directed triangles in directed graphs
Discrete Mathematics, 1992 The authors show that if each vertex of an oriented graph \(G_ n\) has indegree and outdegree at least \(n/t\), where \(t=2.867\dots,\) then \(G_ n\) contains an oriented 3-cycle.
Maurits de Graaf +2 more
openaire +3 more sources
Covering the edges of a graph with triangles
Discrete MathematicsMotivated by a question of \textit{P. Erdős} et al. [ibid. 150, No. 1--3, 89--101 (1996; Zbl 0857.05077)], the authors study the relationship between the following graph invariants. Let~\(G\) be an undirected graph. \begin{itemize} \item \(\rho_{\Delta}(G)\) is the minimum cardinality of a set consisting of edges and triangles that together cover~\(E(G)
Csilla Bujtás +5 more
openaire +6 more sources
On star coloring of Mycielskians
Indonesian Journal of Combinatorics, 2018 In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph G into a new graph μ(G), we now call the Mycielskian of G, which has the same clique number as G and whose ...
K. Kaliraj, V. Kowsalya, Vernold Vivin
doaj +1 more source
Triangle-factors in powers of graphs
Electronic Notes in Discrete Mathematics, 2003 Abstract In this paper, we investigate existence of triangle-factors, that is 2-factors in which every cycle is of length 3, in powers of graphs of order 3 k , k ≥ 1. It is easy to show that G 4 contains a triangle-factor for any connected graph and G 3 contains a triangle-factor for any connected claw-free graph G Our main result is that G
AGARWAL, NARENDRA, DIWAN, AJIT A
openaire +2 more sources