Results 41 to 50 of about 405,795 (217)
Complete edge-colored permutation graphs
Advances in Applied Mathematics, 2022 Nous introduisons le concept de graphes de permutation complets de couleur d'arête comme des graphes complets qui sont l'union bord-disjonction de graphes de permutation « classiques ». Nous montrons qu'un graphe G=(V,E) est un graphe de permutation complet de couleur de bord si et seulement si chaque sous-graphe monochromatique de G est un graphe de ...
Tom Hartmann +5 more
openaire +5 more sources
A note on star coloring of central graph of bipartite graph and corona graph of complete graph with path and cycle [PDF]
Transactions on Combinatorics, 2012 In this paper, we find the star chromatic number of central graph of complete bipartite graph and corona graph of complete graph with path and cycle.
V. J. Vernold, M. Venkatachalam
doaj
Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
Electronic Notes in Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jendrol’, Stanislav +2 more
openaire +2 more sources
The ramsey number for theta graph versus a clique of order three and four
Discussiones Mathematicae Graph Theory, 2014 For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is the smallest positive integer N with the property that every graph on at least N vertices contains F1 or its complement contains F2 as a subgraph.
Bataineh M.S.A. +2 more
doaj +1 more source
Radio Labeling for Strong Product K3 ⊠ Pn
IEEE Access, 2020 Many variations of graph labeling has been defined in the literature. e.g., graceful, harmonious and radio labeling etc. In information technology and in data sciences, we need secrecy of data, different channel assignment and accuracy of transmission of
Hengxiao Qi +4 more
doaj +1 more source
On Order Prime Divisor Graphs of Finite Groups
Discussiones Mathematicae - General Algebra and Applications, 2021 The order prime divisor graph 𝒫𝒟(G) of a finite group G is a simple graph whose vertex set is G and two vertices a, b ∈ G are adjacent if and only if either ab = e or o(ab) is some prime number, where e is the identity element of the group G and o(x ...
Sen Mridul K. +2 more
doaj +1 more source
Journal of the Australian Mathematical Society, 1974 In general, a structure is called rigid if it admits only the trivial structure preserving transformations. Of course, what is trivial depends on the context. In [7] the authors understand by a rigid graph one which has the property that the only edge preserving transformation of the vertices is the identity map.
openaire +2 more sources
Decomposition of the completer-graph into completer-partiter-graphs
Graphs and Combinatorics, 1986 Let \(K_ r(n)\) be a complete r-partite hypergraph with n vertices. By \(f_ r(n)\) is denoted the minimal number q of pairwise edge-disjoint r- partite complete r-uniform hypergraphs which cover all edges of \(K_ r(n).\) In the paper is given an asymptotic value of the \(f_ r(n)\). For every fixed \(r\geq 1\) exist two positive numbers \(c_ 1(r)\) and \
openaire +2 more sources
IEEE Access, 2018 In this paper, we have proposed altogether different and new approaches for the computation of all possible spanning trees of a simple, undirected, and connected graph.
Maumita Chakraborty +2 more
doaj +1 more source
Quasistationary Distribution for the Invasion Model on a Complete Bipartite Graph [PDF]
, 2022 Iddo Ben-Ari +5 more
openalex +1 more source