Results 31 to 40 of about 258,952 (290)
On The Fault Tolerant Geodetic Number Of Total And Middle Number Of A Graph [PDF]
, 2023 The total graph of a graph is a graph such that the vertex set of corresponds to the vertices and edges of and two vertices are adjacent in if and only if their corresponding element are either adjacent or incident in &
K.Bensiger, T.Jeba Raj
core +1 more source
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
Discussiones Mathematicae Graph Theory, 2013 The technique of counting cliques in networks is a natural problem. In this paper, we develop certain results on counting of triangles for the total graph of the Mycielski graph or central graph of star as well as completegraph families.
Patil H.P., Pandiya Raj R.
doaj +1 more source
Relationship between chlorophyll-a, sea surface temperature, and sea surface salinity [PDF]
Global Journal of Environmental Science and Management, 2023 BACKGROUND AND OBJECTIVES: This study aimed to investigate the long-term relationship between chlorophyll-a, sea surface temperature, and sea surface salinity monthly from January 2015 to December 2021.
M. Hidayat +4 more
doaj +1 more source
Study of middle graph for certain classes of graph by applying degree-based topological indices [PDF]
, 2023 Copyright © 2023 by SPC.Topological indices are extremely useful for analyzing various physical and chemical properties associated with a chemical compound.
Sardar, Muhammad Shoaib +3 more
core +1 more source
Compiler Optimization: A Case for the Transformation Tool Contest [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 An optimizing compiler consists of a front end parsing a textual programming language into an intermediate representation (IR), a middle end performing optimizations on the IR, and a back end lowering the IR to a target representation (TR) built of ...
Sebastian Buchwald, Edgar Jakumeit
doaj +1 more source
Hamiltonicity of complements of middle graphs
Discrete Mathematics, 2007 Let \(G(V,E)\) be an undirected finite simple graph. The middle graph \(M(G)\) of \(G\) has the vertex set \(V(G)\cup E(G)\) and two vertices \(x,y\) of \(M(G)\) are adjacent in \(M(G)\) if at least one of them corresponds to an edge \(e\) of \(G\) and the other one is either one of the endvertices of \(e\) in \(G\), or corresponds to an edge \(f\) of \
Xinhui An, Baoyindureng Wu
openaire +1 more source
Discussiones Mathematicae Graph Theory, 2015 Erratum Identification and corrections of the existing mistakes in the paper On the total graph of Mycielski graphs, central graphs and their covering numbers, Discuss. Math. Graph Theory 33 (2013) 361-371.
Forouhandeh S.F. +4 more
doaj +1 more source
On the Boolean function graph of a graph and on its complement [PDF]
, 2005 summary:For any graph $G$, let $V(G)$ and $E(G)$ denote the vertex set and the edge set of $G$ respectively. The Boolean function graph $B(G,L(G),\mathop {\mathrm NINC})$ of $G$ is a graph with vertex set $V(G)\cup E(G)$ and two vertices in $B(G,L(G ...
Muthammai, S. +2 more
core +1 more source
Journal of Educational Research in Mathematics, 2020 In this study, in order to explore ways that statistical graphs teaching in elementary mathematics education can be improved, first, the types of statistical graphs that appear in middle school social textbooks were examined, and second, the ...
Byungjoo Tak, Eun-Sung Ko
doaj +1 more source
On Domatic Number of Some Rotationally Symmetric Graphs
Journal of Mathematics, 2023 Domination is a well-known graph theoretic concept due to its significant real-world applications in several domains, such as design and communication network analysis, coding theory, and optimization.
Hassan Raza +2 more
doaj +1 more source