Results 41 to 50 of about 2,650,610 (297)
Properties of Hereditary Hypergraphs and Middle Graphs [PDF]
AbstractThe middle graph of a graph G=( V, E) is the graph M(G) = (V∪E, E′), in which two vertices u, v are adjacent if either M is a vertex in V and v is an edge in E containing u, or u and v are edges in E having a vertex in common. Middle graphs have been characterized in terms of line graphs by Hamada and Yoshimura [7], who also investigated their ...
Cockayne, E. J. +2 more
openaire +1 more source
On k-rainbow domination in middle graphs [PDF]
Let G be a finite simple graph with vertex set V(G) and edge set E(G). A function f : V(G) → P({1,2,…,k}) is a k-rainbow dominating function on G if for each vertex v∈V(G) for which f(v) = ∅, it holds that ⋃u∈N(v) f(u) = {1,2,…,k}. The weight of a k-rainbow dominating function is the value ∑v∈V(G)|f(v)|.
openaire +3 more sources
Status Connectivity Indices of Middle graph
Topological index is sometimes also known as graph theoretic index, is a numerical invariant of a graph, the topological indices are classified on degree and distance based concepts.
Roopa Subhas Naikar
doaj +1 more source
Genus Distribution for a Graph [PDF]
In this paper we develop the technique of a distribution decomposition for a graph. A formula is given to determine genus distribution of a cubic graph.
Liangxia, Wan +2 more
core +1 more source
Computation of Vertex-Based Topological Indices of Middle Graph of Alkane CtH2t+2
Alkanes are the primary constituents of methane or natural gas that can also be found in volcanic crust. As a result of methane as a heat source, humans may cook without using any fuel in a volcanic environment.
Muhammad Shoaib Sardar +5 more
doaj +1 more source
On Pathos Semitotal and Total Block Graph of a Tree [PDF]
The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number of line disjoint open paths whose union is G. The path number of a graph G is the number of paths in pathos.
Muddebihal M. H.
core +1 more source
Graph equations for line graphs, total graphs, middle graphs and quasi-total graphs
Let G be a simple finite and connected graph with the vertex set V(G) and the edge set X(G). Let V'(G) be the family of all one-point subsets of V(G). Both the line graph L(G) of G and the total graph T(G) of G are standard graph theoretical concepts. The middle graph M(G) of G is the intersection graph of \(V'(G)\cup X(G)\) and the quasi-total graph P(
D. V. S. Sastry, B. Syam Prasad Raju
openaire +3 more sources
On the rainbow connection numbers of line, middle, and total graphs of wheels
An edge-colored graph G is called rainbow connected if any two vertices in G are connected by a path whose no two edges are colored the same. The rainbow connection of G, denoted by rc(G), is the smallest number of colors needed such that G be a rainbow ...
Lyra Yulianti +2 more
doaj +1 more source
Modeling the technological process of whelled harvester by applying Graph theory [PDF]
The article presents typical schemes of the development of the harvest area and the technological operations performed by a middle-class feller-delimber-buncher (FDB) (Ponsse Ergo 8W) in the middle taiga of the Komi Republic under natural and production ...
Svoikin F.V. +5 more
doaj +1 more source
Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source

