Results 31 to 40 of about 1,691,893 (274)
Edge-maximal -free non-bipartite Hamiltonian graphs of odd order
AKCE International Journal of Graphs and Combinatorics, 2022 Let [Formula: see text] denote the class of non-bipartite graphs on n vertices containing no [Formula: see text]-graph and [Formula: see text] Let [Formula: see text] denote the class of non-bipartite Hamiltonian graphs on n vertices containing no ...
M. M. M. Jaradat +4 more
doaj +1 more source
Completely connected clustered graphs
Journal of Discrete Algorithms, 2003 A clustered graph \((G,T,r)\) consists of a graph \(G=(V,E)\), a tree \(T\), and an inner vertex \(r\) of \(T\) such that the set of leaves of \(T\) is exactly \(V\). A clustered graph is said to be completely connected if every cluster, and also each complement of a cluster, induces a connected subgraph.
Cornelsen, Sabine, Wagner, Dorothea
openaire +2 more sources
On dynamic colouring of cartesian product of complete graph with some graphs
Journal of Taibah University for Science, 2020 A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj +2 more
doaj +1 more source
On Some Properties of Characteristics Polynomials of the Complete Graphs Kn [PDF]
Engineering and Technology Journal, 2013 This paper discusses the properties of the characteristic polynomial of the complete graphs Kn, n=1, 2… respective to the adjacency matrices. Two different types of matrices, the adjacency matrix and the signless Laplacian matrix, are presented.
Nuha A. Rajab +2 more
doaj +1 more source
Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph
, 2016 A graph is an efficient open domination graph if there exists a subset of vertices whose open neighborhoods partition its vertex set. We characterize those graphs $G$ for which the Cartesian product $G \Box H$ is an efficient open domination graph when ...
Peterin, Iztok +3 more
core +1 more source
When Is a Graded Free Complex Exact?
Mathematics, 2022 Minimal free resolutions of a finitely generated module over a polynomial ring S=k[x], with variables x={x1,…,xn} and a field k have been extensively studied.
David C. Molano +2 more
doaj +1 more source
GCG: Mining Maximal Complete Graph Patterns from Large Spatial Data
, 2013 Recent research on pattern discovery has progressed from mining frequent patterns and sequences to mining structured patterns, such as trees and graphs. Graphs as general data structure can model complex relations among data with wide applications in web
Al-Naymat, Ghazi
core +1 more source
Teorema Pohon Matriks Untuk Menentukan Banyaknya Pohon Rentangan Graf Bipartisi Komplit (Km,n)
Fokus, 2016 This research aims to observes panning tree number of complete bipartite graph (Km,n) by matrix-tree theorem.This research was using library research method which the step are:(1)Drawing complete bipartite graph (Km,n) where m= 1,2,3,4,and; (2)Determinin
Novia Rahmawati
doaj +1 more source
Decomposing the complete r-graph
Journal of Combinatorial Theory, Series A, 2018 Let $f_r(n)$ be the minimum number of complete $r$-partite $r$-graphs needed to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. Graham and Pollak showed that $f_2(n) = n-1$. An easy construction shows that $f_r(n)\le (1-o(1))\binom{n}{\lfloor r/2\rfloor}$ and it has been unknown if this upper bound is asymptotically sharp.
Imre Leader +2 more
openaire +4 more sources
An Average Case NP-Complete Graph Coloring Problem
, 2017 NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring
Levin, Leonid A. +1 more
core +1 more source