ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Computing
Computing
Education
Physical
Research
Economy
Pure sciences
Social Sciences
all records (68)

Languages
English
Spanish
German
Portuguese
French

Countries
Australia
Indonesia
USA
Chile
Brazil
Ukraine
Italy
Turkey, Turkish Republic
India
Romania
all records (58)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
2.439  Articles
1 of 245 pages  |  10  records  |  more records»
We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph.  This leads to a characterization of chordal graphs via deletio... see more

We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees. Even more, the edges of a clique tree are in bijection wi... see more

The clique polynomial C(G, x) of a finite, simple and undirected graph G = (V, E) is defined as the ordinary generating function of the number of complete subgraphs of G. A real root of C(G, x) is called a clique root of the graph G. Hajiabolhasan and Meh... see more

In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General bi-Cohen-Macaulay graphs are classified up to separation. The inseparable bi-Cohen-Macaulay graphs are... see more

We show that the independence complex of a chordal graph is contractible if and only if this complex is dismantlable (strong collapsible) and it is homotopy equivalent to a sphere if and only if its core is a cross-polytopal sphere. The proof uses the pro... see more

For a poset P=(X,=P), the strict-double-bound graph of P is the graph sDB(P) on V(sDB(P))=X for which vertices u and v of sDB(P) are adjacent if and only if u ? v and there exist elements x,y ? X distinct from u and v such that x =P u =P&nb... see more

Let G be a simple undirected graph on n vertices. Francisco and VanTuyl have shown that if G is chordal ...

For any non-abelian group G, the non-commuting graph of G, G=GG, is a graph with vertex set G \ Z(G), where Z(G) is the set of elements of G that commute with every element of G and distinct non-central elements x and y of G are joined by an edge if and o... see more

Given a graph GG and an odd prime pp, for a mapping f:E(G)?Zp\{0}f: E(G) \to {\mathbb Z}_p\setminus\{0\} and a Zp{\mathbb Z}_p-boundary bb of GG, an orientation t\tau is called an (f,b;p)(f,b;p)-orientation if the net out ff-flow is the same as b(v)b(v) i... see more

1 of 245 pages  |  10  records  |  more records»