Results 31 to 40 of about 142,607 (267)
The Determinant of Matching Matrix in the Evaluation of Matching Polynomial
A characterization is given for graphs whose matching polynomial is the determinant of their matching matrices. The matching matrix is then modified and its relation with other graph polynomials is examined.
Shanaz A. Wahid
doaj +1 more source
Problem-based scaffolding for prospective mathematics teachers in graph theory course
This study aimed to give a scaffolding process to improve the preservice teachers' ability in graph theory class. The present study implemented scaffolding techniques by administering graph theory questions.
Yunita Oktavia Wulandari +2 more
doaj +1 more source
A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the λβ or the least sensible λ-theory ℋ (which is generated by equating all the unsolvable terms). A related question is whether, given a class of lambda models, there are a minimal λ-theory and a minimal ...
BUCCIARELLI A, SALIBRA, Antonino
openaire +4 more sources
Application of practice-based learning in graph theory
Learning graph theory is an important topic in the world of mathematics and computer science. However, students often face difficulties in understanding the concepts and practical application of graph theory. Therefore, this study aims to apply practicum-
Marhadi Saputro, Iwit Prihatin
doaj +1 more source
Odd harmonious labeling on the amalgamation of the generalized double quadrilateral windmill graph
Graph labeling is one of the topics of graph theory that is growing very rapidly both in terms of theory and application. A graph that satisfies the labeling property of odd harmonious is called an odd harmonious graph.
Fery Firmansah, Wed Giyarti
doaj +1 more source
If \(k\) is a field and \(G\) is a graph on a vertex set \(\{v_ 1, \dots, v_ n\}\), then the edge ideal \(I = I(G) \subset R = k[x_ 1, \dots, x_ n]\) is generated by all \(x_ ix_ j\) such that \(v_ iv_ j\) is an edge of \(G\). We shall assume there are no edges of type \(v_ iv_ i\), so \(I\) is square-free and \(R/I\) is a special case of a face ring ...
Simis, Aron +2 more
openaire +2 more sources
One of the concepts in mathematics that developing rapidly today is Graph Theory. The development of Graph Theory has been combined with Group Theory, that is by representing a group in a graph.
Dewi Santri Ramdani +2 more
doaj +1 more source
Density-functional theory on graphs [PDF]
The principles of density-functional theory are studied for finite lattice systems represented by graphs. Surprisingly, the fundamental Hohenberg–Kohn theorem is found void, in general, while many insights into the topological structure of the density-potential mapping can be won.
Penz, Markus, van Leeuwen, Robert
openaire +5 more sources
On Total H-Irregularity Strength of the Disjoint Union of Graphs
A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and
Ashraf Faraha +5 more
doaj +1 more source
Exploring the Power of Graph Theory in Hadron Theory: From Bound States to Quark Systems
The article discusses how graph theory has been utilized in hadron theory for high energy interactions in recent years. The paper emphasizes the significance of a visual perspective throughout the discussion and explores how graph theory can aid in ...
M. Abu-shady
doaj +1 more source

