Results 261 to 270 of about 2,650,610 (297)
MISCELLANEOUS PROPERTIES OF MIDDLE GRAPHS
MISCELLANEOUS PROPERTIES OF MIDDLE GRAPHSopenaire +1 more source
Traversability and connectivity of the middle graph of a graph [PDF]
Discrete Mathematics, 1976 We define a graph M(G) as an intersection graph Ω(F) on the point set V(G) of any graph G. Let X(G) be the line set of G and F = V′(G) ∪ X(G), where V′(G) indicates the family of all one point subsets of the set V(G). Let M(G) = Ω(F).
Takashi Hamada +3 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the edge-tenacity of the middle graph of a graph
International Journal of Computer Mathematics, 2005We consider the problem of efficiently breaking a graph into small components by removing edges. One measure of how easily this can be done is the edge-tenacity. Given a set of edges of G, the score of S is defined as sc(S)=[| S|+τ (G−S)]/[w(G−S)]. Formally, the edge-tenacity of a graph G is defined as T′(G)=min sc(S), where the minimum is taken over ...
Aysun Aytaç
exaly +4 more sources
Bartholdi zeta functions of line graphs and middle graphs of graph coverings
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hirobumi Mizuno
exaly +3 more sources
Radio number for middle graph of paths [PDF]
Electronic Notes in Discrete Mathematics, 2017 8 Pages, CTGTC 2016 conference proceedings ...
Devsi Bantva
exaly +4 more sources
A Note on the Integrity of Middle Graphs
2007The integrity I(G) of a noncomplete connected graph G is a measure of network invulnerability and is defined by I(G) = min{|S + m(G - S)}, where S and m(G - S) denote the the subset of V and the order of the largest component of G - S, respectively. In this paper, we determine the integrity and some other parameters of middle graphs of some classes of ...
Aygul Mamut, Elkin Vumar
openaire +2 more sources
Domination-related parameters in middle graphs
Discrete Mathematics, Algorithms and Applications, 2023The middle graph [Formula: see text] of a graph [Formula: see text] is the graph obtained by subdividing each edge of [Formula: see text] exactly once and joining all these newly introduced vertices of adjacent edges of [Formula: see text]. It is known that the decision problems for Italian domination number [Formula: see text], [Formula: see text ...
openaire +3 more sources
The dominated chromatic number of middle graphs
The Art of Discrete and Applied Mathematics, 2022Summary: A dominated coloring of a graph is a proper vertex coloring such that every color class is dominated with at least one vertex. The minimum number of colors needed for a dominated coloring of a graph \(G\) is the dominated chromatic number of \(G\). The middle graph \(M(G)\) of a graph \(G\) is the graph obtained by subdividing each edge of \(G\
openaire +2 more sources
Zeta functions and complexities of middle graphs of semiregular bipartite graphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources