Results 81 to 90 of about 11,128 (261)
Chromatic polynomaials for regular graphs and modified wheels
Journal of Combinatorial Theory, Series B, 1981 Let P(G;λ) denote the chromatic polynomial of a graph G, expressed in the variable λ. A graph G is chromatically unique if P(G;λ)=P(H;λ) implies that H is isomorphic to G. We prove that complements of partial matching forests are chromatically unique.
Beatrice Loerinc +1 more
openaire +3 more sources
Energy Science &Engineering, EarlyView.This study develops and evaluates a solar PV‐fed electric bicycle system optimized for university campuses in Pakistan. The techno‐economic analysis demonstrates significant fuel savings, emission reductions, and sustainability benefits, promoting a cost‐effective, eco‐friendly, and renewable transportation alternative amid rising global fuel and ...
Muhammad Abdullah Khan +4 more
wiley +1 more source
Complexity of Graphs with Wheel Graph and Fan Graph as their Blocks
JTAM (Jurnal Teori dan Aplikasi Matematika)The complexity of a graphs remains an active area of research within graph theory. Let G be an undirected connected graph. Graph G is said as a non-separable graph if it does not have cut-vertex. A maximal non-separable subgraph of graph G is called a block of G. Every connected graph G has at least one spanning tree.
Alexander Alexander +2 more
openaire +1 more source
Food Chemistry International, EarlyView.Gac fruit's high carotenoid content, especially in the aril, makes it an excellent natural red pigment source for food applications, offering a safer alternative to synthetic dyes. Ethanol extraction achieved the highest overall pigment recovery (89.53%), whereas ethyl lactate extraction yielded the highest levels of total carotenoids, β‐carotene ...
N. Netravati +4 more
wiley +1 more source
Planar graphs with no 6-wheel minor
Discrete Mathematics, 1993 By Tutte's wheels theorem [Nederl. Akad. Wet., Proc. Ser. A 64, 441-455 (1961; Zbl 0101.409)], every simple 3-connected graph can be built from some wheel graph by adding edges and splitting vertices. Moreover, \textit{B. Oporowski}, \textit{J. Oxley} and \textit{R. Thomas} [J. Comb. Theory, Ser.
openaire +2 more sources
Bank Income Smoothing, Societal Patriarchy and Policy Uncertainty
International Journal of Finance &Economics, EarlyView.ABSTRACT Using a sample of 745 banks from 26 OECD countries over the period 1997–2023, we investigate the moderating effects of societal patriarchy on bank income smoothing (IS), amidst policy uncertainty (PU). Results indicate that in periods of high PU, banks operating in highly patriarchal societies tend to curtail the use of loan loss provisions ...
Tanveer Ahsan +4 more
wiley +1 more source
A PROPERLY EVEN HARMONIOUS LABELING OF SOME WHEEL GRAPH W_n FOR n IS EVEN
BarekengA properly even harmonious labeling of a graph G with q edges is an injective mapping f from the vertices of graph G to the integers from 0 to 2q-1 such that induces a bijective mapping f* from the edges of G to {0,2,...,2q-2} defined by f*(v_iv_j)=(f ...
Fakhrun Nisa +2 more
doaj +1 more source
Journal of Graph Theory, EarlyView.ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley +1 more source
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source