Endomorphism-regularity of split graphs (Q5927687): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1006/eujc.2000.0443 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/eujc.2000.0443 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025488733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-like \(P_4\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4392076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4126563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute retracts of split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endomorphisms of graphs. II: Various unretractive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endomorphism spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endomorphisms of graphs. I: The monoid of strong endomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A regular endomorphism of a graph and its inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems raised at the Problem Session of the Colloquium on Semigroups in Szeged, August 1987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with a regular endomorphism monoid / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/EUJC.2000.0443 / rank
 
Normal rank

Latest revision as of 11:44, 9 December 2024

scientific article; zbMATH DE number 1580085
Language Label Description Also known as
English
Endomorphism-regularity of split graphs
scientific article; zbMATH DE number 1580085

    Statements

    Endomorphism-regularity of split graphs (English)
    0 references
    0 references
    0 references
    21 June 2001
    0 references
    The graphs considered are finite undirected graphs without loops and multiple edges. A graph \(G(V,E)\) is called a split graph if its vertex-set can be partitioned into disjoint (non-empty) sets \(S\) and \(K\), i.e., \(V = K\cup S\), such that \(S\) is a stable set and \(K\) is a complete graph, where stable means that the vertices of \(S\) are pairwise non-adjacent. The graph is called endo-regular if its endomorphism monoid is (von Neumann) regular. The authors prove: Let \(G(V,E)\) be a connected split graph with \(V= K\cup S\) and \(|K|= n\). Then \(G\) is endo-regular if and only if there exists \(r\in \{ 1,2,\ldots, n\}\) such that \(d(x) = r\) for any \(x\in S\); or there exists a vertex \(a\in S\) with \(d(a) = n\) and there exists \(r\in \{1,2,\ldots, n-1\}\) such that \(d(x) = r\) for any \(x\in S\backslash \{ a\}\) (if \(S\backslash \{ a\} \neq \emptyset\)). \parskip 0mm A non-connected split graph \(G\) is endo-regular if and only if \(G\) exactly consists of a complete graph and several isolated vertices. \parskip 0mm On the way it is proved that a regular element \(f\) of the endomorphism monoid of a graph \(G\) is always half strong, i.e., if \(\{f(a), f(b)\}\) is an edge, then there exist \(c\in f^{-1}\big(f(a)\big)\) and \(d\in f^{-1} \big(f(b)\big)\) such that \(\{ c,d\}\) is an edge, where \(a,b,c,d\in V\).
    0 references
    0 references
    regular monoid
    0 references
    split graph
    0 references
    half strong
    0 references

    Identifiers